Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171200148.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is HealthRecord-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 37K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME net-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621341199990

[2021-05-18 12:33:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:33:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:33:21] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-18 12:33:21] [INFO ] Transformed 125 places.
[2021-05-18 12:33:21] [INFO ] Transformed 246 transitions.
[2021-05-18 12:33:21] [INFO ] Found NUPN structural information;
[2021-05-18 12:33:21] [INFO ] Parsed PT model containing 125 places and 246 transitions in 94 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 925 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:33:21] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2021-05-18 12:33:21] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-18 12:33:22] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned unsat
[2021-05-18 12:33:22] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:33:22] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2021-05-18 12:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:22] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-18 12:33:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:33:22] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:22] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 21 ms.
[2021-05-18 12:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 292 ms returned sat
[2021-05-18 12:33:22] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:22] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-18 12:33:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:22] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 19 ms.
[2021-05-18 12:33:23] [INFO ] Added : 137 causal constraints over 29 iterations in 625 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-18 12:33:23] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:23] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-18 12:33:23] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:23] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 19 ms.
[2021-05-18 12:33:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 276 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:24] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:24] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 22 ms.
[2021-05-18 12:33:24] [INFO ] Added : 122 causal constraints over 25 iterations in 515 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned unsat
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned unsat
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:24] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-18 12:33:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] Deduced a trap composed of 34 places in 54 ms
[2021-05-18 12:33:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:33:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:25] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 18 ms.
[2021-05-18 12:33:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 71 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:25] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:33:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:25] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 15 ms.
[2021-05-18 12:33:26] [INFO ] Added : 140 causal constraints over 28 iterations in 726 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2021-05-18 12:33:26] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-18 12:33:26] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:26] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:33:26] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 16 ms.
[2021-05-18 12:33:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 70 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:26] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:26] [INFO ] Computed and/alt/rep : 236/1548/228 causal constraints in 17 ms.
[2021-05-18 12:33:27] [INFO ] Added : 113 causal constraints over 23 iterations in 365 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-18 12:33:27] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 10000 steps, including 619 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18700 steps, including 905 resets, run finished after 65 ms. (steps per millisecond=287 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14600 steps, including 844 resets, run finished after 44 ms. (steps per millisecond=331 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 16700 steps, including 664 resets, run finished after 42 ms. (steps per millisecond=397 ) properties seen :[0, 0] could not realise parikh vector
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 173 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 275 ms
Free SCC test removed 2 places
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (complete) has 459 edges and 123 vertex of which 115 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.17 ms
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 115 transition count 222
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 113 transition count 218
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 111 transition count 217
Symmetric choice reduction at 3 with 56 rule applications. Total rules 74 place count 111 transition count 217
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 112 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 186 place count 55 transition count 105
Symmetric choice reduction at 3 with 9 rule applications. Total rules 195 place count 55 transition count 105
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 213 place count 46 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 216 place count 46 transition count 84
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 46 transition count 84
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 43 transition count 75
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 43 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 234 place count 40 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 237 place count 40 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 247 place count 35 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 35 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 251 place count 33 transition count 87
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 261 place count 33 transition count 87
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 269 place count 33 transition count 87
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 33 transition count 87
Applied a total of 270 rules in 328 ms. Remains 33 /125 variables (removed 92) and now considering 87/237 (removed 150) transitions.
[2021-05-18 12:33:27] [INFO ] Flow matrix only has 75 transitions (discarded 12 similar events)
// Phase 1: matrix 75 rows 33 cols
[2021-05-18 12:33:27] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 12:33:27] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions :[85, 84, 83, 82, 81, 80, 79, 78, 77]
Starting structural reductions, iteration 1 : 33/125 places, 78/237 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 100 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 77
Applied a total of 3 rules in 5 ms. Remains 31 /33 variables (removed 2) and now considering 77/78 (removed 1) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/125 places, 77/237 transitions.
Finished random walk after 7476 steps, including 823 resets, run visited all 2 properties in 26 ms. (steps per millisecond=287 )
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341209178

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-05.tgz
mv HealthRecord-PT-05 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;