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.r094-tall-162048902500212.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 DoubleExponent-PT-004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 67K May 5 16:51 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 DoubleExponent-PT-004-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620746008032

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:13:29] [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, -timeout, 3600, -rebuildPNML]
[2021-05-11 15:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:13:29] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-11 15:13:29] [INFO ] Transformed 216 places.
[2021-05-11 15:13:29] [INFO ] Transformed 198 transitions.
[2021-05-11 15:13:29] [INFO ] Parsed PT model containing 216 places and 198 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 345 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 299 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, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 553820 states, properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1107687 steps, saw 553820 distinct states, run finished after 4310 ms. (steps per millisecond=257 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-004-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 7469807 steps, run timeout after 30001 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
Exhaustive walk after 7469807 steps, saw 3734603 distinct states, run finished after 30001 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-004-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 198 rows 216 cols
[2021-05-11 15:14:04] [INFO ] Computed 24 place invariants in 22 ms
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 2 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 3 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-11 15:14:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned unsat
[2021-05-11 15:14:05] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned unsat
[2021-05-11 15:14:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-11 15:14:05] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2021-05-11 15:14:05] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:05] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-11 15:14:05] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 35 ms.
[2021-05-11 15:14:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:14:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:14:05] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:05] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-11 15:14:05] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:14:06] [INFO ] Added : 194 causal constraints over 39 iterations in 634 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-11 15:14:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-11 15:14:06] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2021-05-11 15:14:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:06] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:14:06] [INFO ] Deduced a trap composed of 73 places in 91 ms
[2021-05-11 15:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2021-05-11 15:14:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:14:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:14:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:07] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-11 15:14:07] [INFO ] Deduced a trap composed of 73 places in 86 ms
[2021-05-11 15:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2021-05-11 15:14:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2021-05-11 15:14:07] [INFO ] Added : 191 causal constraints over 39 iterations in 594 ms. Result :sat
[2021-05-11 15:14:07] [INFO ] Deduced a trap composed of 48 places in 39 ms
[2021-05-11 15:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
FORMULA DoubleExponent-PT-004-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 175400 steps, including 6265 resets, run finished after 365 ms. (steps per millisecond=480 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 214300 steps, including 7628 resets, run finished after 453 ms. (steps per millisecond=473 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 360 edges and 216 vertex of which 211 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 210 transition count 148
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 101 place count 161 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 161 transition count 141
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 115 place count 154 transition count 141
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 195 place count 114 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 207 place count 108 transition count 101
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 218 place count 108 transition count 90
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 229 place count 97 transition count 90
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 245 place count 97 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 89
Applied a total of 246 rules in 66 ms. Remains 96 /216 variables (removed 120) and now considering 89/198 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/216 places, 89/198 transitions.
Incomplete random walk after 1000000 steps, including 128068 resets, run finished after 2042 ms. (steps per millisecond=489 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84460 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84921 resets, run finished after 1240 ms. (steps per millisecond=806 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 10507381 steps, run timeout after 30001 ms. (steps per millisecond=350 ) properties seen :[0, 0]
Probabilistic random walk after 10507381 steps, saw 5252003 distinct states, run finished after 30001 ms. (steps per millisecond=350 ) properties seen :[0, 0]
// Phase 1: matrix 89 rows 96 cols
[2021-05-11 15:14:43] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-11 15:14:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:14:43] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:14:43] [INFO ] Computed and/alt/rep : 88/497/88 causal constraints in 6 ms.
[2021-05-11 15:14:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:14:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:43] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2021-05-11 15:14:43] [INFO ] Computed and/alt/rep : 88/497/88 causal constraints in 6 ms.
[2021-05-11 15:14:43] [INFO ] Added : 87 causal constraints over 18 iterations in 218 ms. Result :sat
[2021-05-11 15:14:43] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2021-05-11 15:14:43] [INFO ] Deduced a trap composed of 8 places in 24 ms
[2021-05-11 15:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:43] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-11 15:14:43] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:14:43] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2021-05-11 15:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-11 15:14:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:14:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-11 15:14:44] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 40 ms returned sat
[2021-05-11 15:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:14:44] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-11 15:14:44] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2021-05-11 15:14:44] [INFO ] Deduced a trap composed of 14 places in 29 ms
[2021-05-11 15:14:44] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-11 15:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2021-05-11 15:14:44] [INFO ] Computed and/alt/rep : 88/497/88 causal constraints in 6 ms.
[2021-05-11 15:14:44] [INFO ] Added : 83 causal constraints over 17 iterations in 265 ms. Result :sat
[2021-05-11 15:14:44] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2021-05-11 15:14:44] [INFO ] Deduced a trap composed of 11 places in 9 ms
[2021-05-11 15:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 92900 steps, including 14013 resets, run finished after 190 ms. (steps per millisecond=488 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 117300 steps, including 17737 resets, run finished after 239 ms. (steps per millisecond=490 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 89/89 transitions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 96 cols
[2021-05-11 15:14:45] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-11 15:14:45] [INFO ] Implicit Places using invariants in 91 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
[2021-05-11 15:14:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 89 rows 95 cols
[2021-05-11 15:14:45] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-11 15:14:45] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 95/96 places, 89/89 transitions.
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 2 place count 94 transition count 88
Applied a total of 2 rules in 6 ms. Remains 94 /95 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 94 cols
[2021-05-11 15:14:45] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-11 15:14:45] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 88 rows 94 cols
[2021-05-11 15:14:45] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-11 15:14:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:14:45] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [20, 26, 62, 67, 85, 91]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 348 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 88/96 places, 88/89 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 85
Applied a total of 6 rules in 15 ms. Remains 85 /88 variables (removed 3) and now considering 85/88 (removed 3) transitions.
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:14:45] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:14:45] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:14:45] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-11 15:14:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:14:45] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 85/96 places, 85/89 transitions.
Incomplete random walk after 1000000 steps, including 144403 resets, run finished after 1808 ms. (steps per millisecond=553 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91612 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 91736 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 11479631 steps, run timeout after 30001 ms. (steps per millisecond=382 ) properties seen :[0, 0]
Probabilistic random walk after 11479631 steps, saw 5737808 distinct states, run finished after 30001 ms. (steps per millisecond=382 ) properties seen :[0, 0]
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:15:20] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-11 15:15:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:15:20] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:15:20] [INFO ] Deduced a trap composed of 11 places in 33 ms
[2021-05-11 15:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-11 15:15:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:15:20] [INFO ] Deduced a trap composed of 11 places in 20 ms
[2021-05-11 15:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-11 15:15:20] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 5 ms.
[2021-05-11 15:15:20] [INFO ] Added : 83 causal constraints over 17 iterations in 214 ms. Result :sat
[2021-05-11 15:15:20] [INFO ] Deduced a trap composed of 8 places in 29 ms
[2021-05-11 15:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:20] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:20] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 5 ms.
[2021-05-11 15:15:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:20] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-11 15:15:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-11 15:15:20] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 6 ms.
[2021-05-11 15:15:20] [INFO ] Added : 82 causal constraints over 17 iterations in 189 ms. Result :sat
[2021-05-11 15:15:20] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2021-05-11 15:15:20] [INFO ] Deduced a trap composed of 13 places in 14 ms
[2021-05-11 15:15:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 51800 steps, including 8672 resets, run finished after 101 ms. (steps per millisecond=512 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 84500 steps, including 14129 resets, run finished after 164 ms. (steps per millisecond=515 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:15:21] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:15:21] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:15:21] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-11 15:15:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:15:21] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2021-05-11 15:15:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:15:21] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:15:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Incomplete random walk after 100000 steps, including 14297 resets, run finished after 191 ms. (steps per millisecond=523 ) properties seen :[0, 0]
// Phase 1: matrix 85 rows 85 cols
[2021-05-11 15:15:21] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:15:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:21] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:21] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-11 15:15:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-11 15:15:21] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:15:21] [INFO ] Deduced a trap composed of 11 places in 9 ms
[2021-05-11 15:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-11 15:15:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:21] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-11 15:15:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-11 15:15:21] [INFO ] Deduced a trap composed of 11 places in 9 ms
[2021-05-11 15:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-11 15:15:21] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 5 ms.
[2021-05-11 15:15:22] [INFO ] Added : 83 causal constraints over 17 iterations in 213 ms. Result :sat
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2021-05-11 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:22] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 5 ms.
[2021-05-11 15:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-11 15:15:22] [INFO ] Computed and/alt/rep : 84/466/84 causal constraints in 5 ms.
[2021-05-11 15:15:22] [INFO ] Added : 82 causal constraints over 17 iterations in 184 ms. Result :sat
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 13 places in 23 ms
[2021-05-11 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 85 transition count 79
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 79 transition count 79
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 79 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 76 transition count 76
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 23 place count 75 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 75 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 74 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 73 transition count 73
Applied a total of 27 rules in 14 ms. Remains 73 /85 variables (removed 12) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 73 cols
[2021-05-11 15:15:22] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-11 15:15:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-11 15:15:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 11 places in 8 ms
[2021-05-11 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-11 15:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 11 places in 10 ms
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 10 places in 13 ms
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 14 places in 9 ms
[2021-05-11 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 42 ms
[2021-05-11 15:15:22] [INFO ] Computed and/alt/rep : 72/403/72 causal constraints in 4 ms.
[2021-05-11 15:15:22] [INFO ] Added : 71 causal constraints over 15 iterations in 149 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:22] [INFO ] Computed and/alt/rep : 72/403/72 causal constraints in 4 ms.
[2021-05-11 15:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:15:22] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-11 15:15:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 11 places in 9 ms
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 10 places in 11 ms
[2021-05-11 15:15:22] [INFO ] Deduced a trap composed of 14 places in 9 ms
[2021-05-11 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 41 ms
[2021-05-11 15:15:22] [INFO ] Computed and/alt/rep : 72/403/72 causal constraints in 4 ms.
[2021-05-11 15:15:23] [INFO ] Added : 70 causal constraints over 14 iterations in 122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-11 15:15:23] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-11 15:15:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
[2021-05-11 15:15:23] [INFO ] Flatten gal took : 63 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DoubleExponent-PT-004 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 951240 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16315480 kB

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

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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r094-tall-162048902500212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 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 ;