Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258000694.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 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 Peterson-COL-6-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590022624512

[2020-05-21 00:57:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2020-05-21 00:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 00:57:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 00:57:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 756 ms
[2020-05-21 00:57:07] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-05-21 00:57:07] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 21 ms.
[2020-05-21 00:57:07] [INFO ] Computed order based on color domains.
[2020-05-21 00:57:07] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 45 ms.
[2020-05-21 00:57:07] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 42 places in 18 ms
Reduce places removed 42 places and 84 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 112 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 318 ms. (steps per millisecond=31 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1]
FORMULA Peterson-COL-6-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 197 ms. (steps per millisecond=50 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 126 ms. (steps per millisecond=79 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 1, 0]
FORMULA Peterson-COL-6-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
[2020-05-21 00:57:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-05-21 00:57:08] [INFO ] Computed 27 place invariants in 83 ms
[2020-05-21 00:57:09] [INFO ] [Real]Absence check using 20 positive place invariants in 77 ms returned unsat
[2020-05-21 00:57:09] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned unsat
[2020-05-21 00:57:09] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-05-21 00:57:09] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2020-05-21 00:57:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2020-05-21 00:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:14] [INFO ] [Real]Absence check using state equation in 4740 ms returned (error "Solver has unexpectedly terminated")
FORMULA Peterson-COL-6-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-6-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-6-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 588 Post agglomeration using F-continuation condition.Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 1176 place count 742 transition count 1155
Deduced a syphon composed of 287 places in 3 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 1750 place count 455 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1834 place count 413 transition count 1113
Applied a total of 1834 rules in 373 ms. Remains 413 /1330 variables (removed 917) and now considering 1113/2030 (removed 917) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/1330 places, 1113/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2402 ms. (steps per millisecond=416 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties seen :[0]
Interrupted probabilistic random walk after 8767944 steps, run timeout after 30001 ms. (steps per millisecond=292 ) properties seen :[0]
Probabilistic random walk after 8767944 steps, saw 1095994 distinct states, run finished after 30002 ms. (steps per millisecond=292 ) properties seen :[0]
[2020-05-21 00:57:47] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2020-05-21 00:57:47] [INFO ] Computed 27 place invariants in 10 ms
[2020-05-21 00:57:48] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned sat
[2020-05-21 00:57:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 00:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:48] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2020-05-21 00:57:49] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 00:57:49] [INFO ] [Real]Added 366 Read/Feed constraints in 51 ms returned sat
[2020-05-21 00:57:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:57:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-21 00:57:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-05-21 00:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:50] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2020-05-21 00:57:50] [INFO ] [Nat]Added 366 Read/Feed constraints in 50 ms returned sat
[2020-05-21 00:57:50] [INFO ] Deduced a trap composed of 43 places in 356 ms
[2020-05-21 00:57:51] [INFO ] Deduced a trap composed of 21 places in 393 ms
[2020-05-21 00:57:51] [INFO ] Deduced a trap composed of 20 places in 272 ms
[2020-05-21 00:57:51] [INFO ] Deduced a trap composed of 20 places in 398 ms
[2020-05-21 00:57:52] [INFO ] Deduced a trap composed of 14 places in 276 ms
[2020-05-21 00:57:52] [INFO ] Deduced a trap composed of 44 places in 284 ms
[2020-05-21 00:57:52] [INFO ] Deduced a trap composed of 21 places in 267 ms
[2020-05-21 00:57:53] [INFO ] Deduced a trap composed of 21 places in 286 ms
[2020-05-21 00:57:53] [INFO ] Deduced a trap composed of 16 places in 204 ms
[2020-05-21 00:57:54] [INFO ] Deduced a trap composed of 41 places in 1175 ms
[2020-05-21 00:57:54] [INFO ] Deduced a trap composed of 17 places in 412 ms
[2020-05-21 00:57:55] [INFO ] Deduced a trap composed of 39 places in 394 ms
[2020-05-21 00:57:55] [INFO ] Deduced a trap composed of 22 places in 273 ms
[2020-05-21 00:57:56] [INFO ] Deduced a trap composed of 25 places in 334 ms
[2020-05-21 00:57:56] [INFO ] Deduced a trap composed of 53 places in 221 ms
[2020-05-21 00:57:56] [INFO ] Deduced a trap composed of 30 places in 191 ms
[2020-05-21 00:57:56] [INFO ] Deduced a trap composed of 37 places in 196 ms
[2020-05-21 00:57:57] [INFO ] Deduced a trap composed of 36 places in 215 ms
[2020-05-21 00:57:57] [INFO ] Deduced a trap composed of 50 places in 201 ms
[2020-05-21 00:57:57] [INFO ] Deduced a trap composed of 90 places in 224 ms
[2020-05-21 00:57:57] [INFO ] Deduced a trap composed of 46 places in 206 ms
[2020-05-21 00:57:58] [INFO ] Deduced a trap composed of 50 places in 211 ms
[2020-05-21 00:57:58] [INFO ] Deduced a trap composed of 31 places in 197 ms
[2020-05-21 00:57:58] [INFO ] Deduced a trap composed of 16 places in 227 ms
[2020-05-21 00:57:58] [INFO ] Deduced a trap composed of 10 places in 285 ms
[2020-05-21 00:57:59] [INFO ] Deduced a trap composed of 31 places in 246 ms
[2020-05-21 00:57:59] [INFO ] Deduced a trap composed of 29 places in 228 ms
[2020-05-21 00:57:59] [INFO ] Deduced a trap composed of 58 places in 264 ms
[2020-05-21 00:57:59] [INFO ] Deduced a trap composed of 41 places in 244 ms
[2020-05-21 00:58:00] [INFO ] Deduced a trap composed of 38 places in 204 ms
[2020-05-21 00:58:00] [INFO ] Deduced a trap composed of 22 places in 190 ms
[2020-05-21 00:58:00] [INFO ] Deduced a trap composed of 26 places in 228 ms
[2020-05-21 00:58:00] [INFO ] Deduced a trap composed of 32 places in 218 ms
[2020-05-21 00:58:01] [INFO ] Deduced a trap composed of 38 places in 207 ms
[2020-05-21 00:58:01] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-05-21 00:58:01] [INFO ] Deduced a trap composed of 68 places in 196 ms
[2020-05-21 00:58:01] [INFO ] Deduced a trap composed of 66 places in 202 ms
[2020-05-21 00:58:02] [INFO ] Deduced a trap composed of 51 places in 199 ms
[2020-05-21 00:58:02] [INFO ] Deduced a trap composed of 34 places in 210 ms
[2020-05-21 00:58:02] [INFO ] Deduced a trap composed of 79 places in 223 ms
[2020-05-21 00:58:02] [INFO ] Deduced a trap composed of 71 places in 190 ms
[2020-05-21 00:58:03] [INFO ] Deduced a trap composed of 47 places in 206 ms
[2020-05-21 00:58:03] [INFO ] Deduced a trap composed of 68 places in 230 ms
[2020-05-21 00:58:03] [INFO ] Deduced a trap composed of 99 places in 245 ms
[2020-05-21 00:58:03] [INFO ] Deduced a trap composed of 30 places in 227 ms
[2020-05-21 00:58:04] [INFO ] Deduced a trap composed of 21 places in 194 ms
[2020-05-21 00:58:04] [INFO ] Deduced a trap composed of 39 places in 235 ms
[2020-05-21 00:58:04] [INFO ] Deduced a trap composed of 53 places in 201 ms
[2020-05-21 00:58:04] [INFO ] Deduced a trap composed of 51 places in 182 ms
[2020-05-21 00:58:04] [INFO ] Deduced a trap composed of 95 places in 191 ms
[2020-05-21 00:58:05] [INFO ] Deduced a trap composed of 51 places in 178 ms
[2020-05-21 00:58:05] [INFO ] Deduced a trap composed of 88 places in 185 ms
[2020-05-21 00:58:05] [INFO ] Deduced a trap composed of 51 places in 190 ms
[2020-05-21 00:58:05] [INFO ] Deduced a trap composed of 94 places in 228 ms
[2020-05-21 00:58:06] [INFO ] Deduced a trap composed of 47 places in 152 ms
[2020-05-21 00:58:06] [INFO ] Deduced a trap composed of 89 places in 163 ms
[2020-05-21 00:58:06] [INFO ] Deduced a trap composed of 62 places in 176 ms
[2020-05-21 00:58:06] [INFO ] Deduced a trap composed of 56 places in 154 ms
[2020-05-21 00:58:06] [INFO ] Deduced a trap composed of 84 places in 183 ms
[2020-05-21 00:58:07] [INFO ] Deduced a trap composed of 85 places in 181 ms
[2020-05-21 00:58:07] [INFO ] Deduced a trap composed of 61 places in 171 ms
[2020-05-21 00:58:07] [INFO ] Deduced a trap composed of 61 places in 150 ms
[2020-05-21 00:58:07] [INFO ] Deduced a trap composed of 61 places in 152 ms
[2020-05-21 00:58:07] [INFO ] Deduced a trap composed of 47 places in 159 ms
[2020-05-21 00:58:08] [INFO ] Deduced a trap composed of 61 places in 155 ms
[2020-05-21 00:58:08] [INFO ] Deduced a trap composed of 43 places in 166 ms
[2020-05-21 00:58:08] [INFO ] Deduced a trap composed of 61 places in 188 ms
[2020-05-21 00:58:08] [INFO ] Deduced a trap composed of 75 places in 185 ms
[2020-05-21 00:58:08] [INFO ] Deduced a trap composed of 35 places in 170 ms
[2020-05-21 00:58:09] [INFO ] Deduced a trap composed of 36 places in 246 ms
[2020-05-21 00:58:09] [INFO ] Deduced a trap composed of 23 places in 240 ms
[2020-05-21 00:58:09] [INFO ] Deduced a trap composed of 68 places in 169 ms
[2020-05-21 00:58:09] [INFO ] Deduced a trap composed of 68 places in 180 ms
[2020-05-21 00:58:10] [INFO ] Deduced a trap composed of 55 places in 196 ms
[2020-05-21 00:58:10] [INFO ] Deduced a trap composed of 72 places in 248 ms
[2020-05-21 00:58:10] [INFO ] Deduced a trap composed of 68 places in 238 ms
[2020-05-21 00:58:10] [INFO ] Deduced a trap composed of 68 places in 181 ms
[2020-05-21 00:58:11] [INFO ] Deduced a trap composed of 68 places in 215 ms
[2020-05-21 00:58:11] [INFO ] Deduced a trap composed of 54 places in 208 ms
[2020-05-21 00:58:11] [INFO ] Deduced a trap composed of 55 places in 198 ms
[2020-05-21 00:58:11] [INFO ] Deduced a trap composed of 55 places in 200 ms
[2020-05-21 00:58:12] [INFO ] Deduced a trap composed of 55 places in 306 ms
[2020-05-21 00:58:12] [INFO ] Deduced a trap composed of 55 places in 178 ms
[2020-05-21 00:58:12] [INFO ] Deduced a trap composed of 30 places in 178 ms
[2020-05-21 00:58:12] [INFO ] Deduced a trap composed of 55 places in 180 ms
[2020-05-21 00:58:13] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-05-21 00:58:13] [INFO ] Deduced a trap composed of 53 places in 146 ms
[2020-05-21 00:58:13] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-05-21 00:58:13] [INFO ] Deduced a trap composed of 31 places in 166 ms
[2020-05-21 00:58:13] [INFO ] Deduced a trap composed of 30 places in 208 ms
[2020-05-21 00:58:14] [INFO ] Deduced a trap composed of 16 places in 195 ms
[2020-05-21 00:58:14] [INFO ] Deduced a trap composed of 49 places in 208 ms
[2020-05-21 00:58:14] [INFO ] Deduced a trap composed of 19 places in 191 ms
[2020-05-21 00:58:14] [INFO ] Deduced a trap composed of 46 places in 144 ms
[2020-05-21 00:58:14] [INFO ] Deduced a trap composed of 47 places in 149 ms
[2020-05-21 00:58:15] [INFO ] Deduced a trap composed of 47 places in 124 ms
[2020-05-21 00:58:15] [INFO ] Deduced a trap composed of 47 places in 118 ms
[2020-05-21 00:58:15] [INFO ] Deduced a trap composed of 47 places in 104 ms
[2020-05-21 00:58:15] [INFO ] Deduced a trap composed of 45 places in 113 ms
[2020-05-21 00:58:15] [INFO ] Deduced a trap composed of 40 places in 204 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 40 places in 236 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 47 places in 132 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 45 places in 133 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 52 places in 122 ms
[2020-05-21 00:58:16] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 37 places in 110 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 36 places in 120 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 53 places in 104 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 36 places in 112 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 53 places in 103 ms
[2020-05-21 00:58:17] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2020-05-21 00:58:18] [INFO ] Deduced a trap composed of 81 places in 252 ms
[2020-05-21 00:58:18] [INFO ] Deduced a trap composed of 37 places in 191 ms
[2020-05-21 00:58:18] [INFO ] Deduced a trap composed of 50 places in 164 ms
[2020-05-21 00:58:19] [INFO ] Deduced a trap composed of 67 places in 217 ms
[2020-05-21 00:58:19] [INFO ] Deduced a trap composed of 57 places in 183 ms
[2020-05-21 00:58:19] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-05-21 00:58:19] [INFO ] Deduced a trap composed of 34 places in 226 ms
[2020-05-21 00:58:20] [INFO ] Deduced a trap composed of 30 places in 183 ms
[2020-05-21 00:58:20] [INFO ] Deduced a trap composed of 45 places in 211 ms
[2020-05-21 00:58:20] [INFO ] Deduced a trap composed of 31 places in 219 ms
[2020-05-21 00:58:20] [INFO ] Deduced a trap composed of 80 places in 207 ms
[2020-05-21 00:58:21] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-05-21 00:58:21] [INFO ] Deduced a trap composed of 50 places in 224 ms
[2020-05-21 00:58:21] [INFO ] Deduced a trap composed of 30 places in 191 ms
[2020-05-21 00:58:21] [INFO ] Deduced a trap composed of 63 places in 172 ms
[2020-05-21 00:58:22] [INFO ] Deduced a trap composed of 46 places in 158 ms
[2020-05-21 00:58:22] [INFO ] Deduced a trap composed of 49 places in 192 ms
[2020-05-21 00:58:22] [INFO ] Deduced a trap composed of 65 places in 180 ms
[2020-05-21 00:58:22] [INFO ] Deduced a trap composed of 44 places in 178 ms
[2020-05-21 00:58:23] [INFO ] Deduced a trap composed of 74 places in 231 ms
[2020-05-21 00:58:23] [INFO ] Deduced a trap composed of 26 places in 208 ms
[2020-05-21 00:58:23] [INFO ] Deduced a trap composed of 43 places in 201 ms
[2020-05-21 00:58:23] [INFO ] Deduced a trap composed of 47 places in 186 ms
[2020-05-21 00:58:24] [INFO ] Deduced a trap composed of 34 places in 209 ms
[2020-05-21 00:58:24] [INFO ] Deduced a trap composed of 42 places in 259 ms
[2020-05-21 00:58:24] [INFO ] Deduced a trap composed of 53 places in 213 ms
[2020-05-21 00:58:24] [INFO ] Deduced a trap composed of 52 places in 169 ms
[2020-05-21 00:58:25] [INFO ] Deduced a trap composed of 52 places in 184 ms
[2020-05-21 00:58:25] [INFO ] Deduced a trap composed of 58 places in 156 ms
[2020-05-21 00:58:25] [INFO ] Deduced a trap composed of 58 places in 160 ms
[2020-05-21 00:58:25] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-05-21 00:58:26] [INFO ] Deduced a trap composed of 69 places in 245 ms
[2020-05-21 00:58:26] [INFO ] Deduced a trap composed of 50 places in 246 ms
[2020-05-21 00:58:26] [INFO ] Deduced a trap composed of 43 places in 206 ms
[2020-05-21 00:58:26] [INFO ] Deduced a trap composed of 35 places in 257 ms
[2020-05-21 00:58:27] [INFO ] Deduced a trap composed of 30 places in 261 ms
[2020-05-21 00:58:27] [INFO ] Deduced a trap composed of 30 places in 266 ms
[2020-05-21 00:58:27] [INFO ] Deduced a trap composed of 51 places in 235 ms
[2020-05-21 00:58:28] [INFO ] Deduced a trap composed of 81 places in 240 ms
[2020-05-21 00:58:28] [INFO ] Deduced a trap composed of 39 places in 211 ms
[2020-05-21 00:58:28] [INFO ] Deduced a trap composed of 32 places in 236 ms
[2020-05-21 00:58:29] [INFO ] Deduced a trap composed of 16 places in 232 ms
[2020-05-21 00:58:29] [INFO ] Deduced a trap composed of 37 places in 199 ms
[2020-05-21 00:58:29] [INFO ] Deduced a trap composed of 36 places in 230 ms
[2020-05-21 00:58:29] [INFO ] Deduced a trap composed of 32 places in 209 ms
[2020-05-21 00:58:29] [INFO ] Deduced a trap composed of 40 places in 162 ms
[2020-05-21 00:58:30] [INFO ] Deduced a trap composed of 39 places in 179 ms
[2020-05-21 00:58:30] [INFO ] Deduced a trap composed of 41 places in 148 ms
[2020-05-21 00:58:30] [INFO ] Deduced a trap composed of 37 places in 193 ms
[2020-05-21 00:58:30] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2020-05-21 00:58:30] [INFO ] Deduced a trap composed of 38 places in 107 ms
[2020-05-21 00:58:31] [INFO ] Deduced a trap composed of 37 places in 118 ms
[2020-05-21 00:58:31] [INFO ] Deduced a trap composed of 72 places in 222 ms
[2020-05-21 00:58:31] [INFO ] Deduced a trap composed of 67 places in 232 ms
[2020-05-21 00:58:32] [INFO ] Deduced a trap composed of 53 places in 167 ms
[2020-05-21 00:58:32] [INFO ] Deduced a trap composed of 37 places in 264 ms
[2020-05-21 00:58:32] [INFO ] Deduced a trap composed of 38 places in 186 ms
[2020-05-21 00:58:32] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-05-21 00:58:33] [INFO ] Deduced a trap composed of 54 places in 232 ms
[2020-05-21 00:58:33] [INFO ] Deduced a trap composed of 91 places in 240 ms
[2020-05-21 00:58:33] [INFO ] Deduced a trap composed of 54 places in 210 ms
[2020-05-21 00:58:33] [INFO ] Deduced a trap composed of 54 places in 181 ms
[2020-05-21 00:58:34] [INFO ] Deduced a trap composed of 56 places in 189 ms
[2020-05-21 00:58:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s5 s15 s25 s26 s42 s43 s44 s46 s47 s48 s64 s65 s66 s67 s68 s69 s75 s90 s94 s95 s100 s101 s117 s132 s136 s137 s142 s143 s178 s179 s184 s185 s228 s229 s230 s303 s304 s305 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s353 s354 s355 s356 s358 s359 s360 s361) 0)") while checking expression at index 0
Support contains 7 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1113/1113 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 39 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-05-21 00:58:34] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2020-05-21 00:58:34] [INFO ] Computed 27 place invariants in 10 ms
[2020-05-21 00:58:35] [INFO ] Implicit Places using invariants in 1398 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1401 ms to find 7 implicit places.
[2020-05-21 00:58:35] [INFO ] Redundant transitions in 90 ms returned []
[2020-05-21 00:58:35] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 00:58:35] [INFO ] Computed 20 place invariants in 28 ms
[2020-05-21 00:58:37] [INFO ] Dead Transitions using invariants and state equation in 1319 ms returned []
Starting structural reductions, iteration 1 : 406/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 35 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-05-21 00:58:37] [INFO ] Redundant transitions in 97 ms returned []
[2020-05-21 00:58:37] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 00:58:37] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-21 00:58:38] [INFO ] Dead Transitions using invariants and state equation in 1567 ms returned []
Finished structural reductions, in 2 iterations. Remains : 406/413 places, 1113/1113 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1960 ms. (steps per millisecond=510 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties seen :[0]
Interrupted probabilistic random walk after 8631496 steps, run timeout after 30001 ms. (steps per millisecond=287 ) properties seen :[0]
Probabilistic random walk after 8631496 steps, saw 1078938 distinct states, run finished after 30001 ms. (steps per millisecond=287 ) properties seen :[0]
[2020-05-21 00:59:11] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 00:59:11] [INFO ] Computed 20 place invariants in 4 ms
[2020-05-21 00:59:11] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-21 00:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:59:12] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-05-21 00:59:12] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 00:59:12] [INFO ] [Real]Added 366 Read/Feed constraints in 54 ms returned sat
[2020-05-21 00:59:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:59:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-21 00:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:59:13] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2020-05-21 00:59:13] [INFO ] [Nat]Added 366 Read/Feed constraints in 56 ms returned sat
[2020-05-21 00:59:13] [INFO ] Deduced a trap composed of 22 places in 236 ms
[2020-05-21 00:59:13] [INFO ] Deduced a trap composed of 37 places in 236 ms
[2020-05-21 00:59:14] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2020-05-21 00:59:14] [INFO ] Deduced a trap composed of 23 places in 236 ms
[2020-05-21 00:59:14] [INFO ] Deduced a trap composed of 30 places in 238 ms
[2020-05-21 00:59:14] [INFO ] Deduced a trap composed of 40 places in 221 ms
[2020-05-21 00:59:15] [INFO ] Deduced a trap composed of 65 places in 255 ms
[2020-05-21 00:59:15] [INFO ] Deduced a trap composed of 55 places in 247 ms
[2020-05-21 00:59:15] [INFO ] Deduced a trap composed of 44 places in 249 ms
[2020-05-21 00:59:16] [INFO ] Deduced a trap composed of 51 places in 274 ms
[2020-05-21 00:59:16] [INFO ] Deduced a trap composed of 47 places in 260 ms
[2020-05-21 00:59:16] [INFO ] Deduced a trap composed of 48 places in 227 ms
[2020-05-21 00:59:16] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-05-21 00:59:17] [INFO ] Deduced a trap composed of 55 places in 283 ms
[2020-05-21 00:59:17] [INFO ] Deduced a trap composed of 28 places in 272 ms
[2020-05-21 00:59:17] [INFO ] Deduced a trap composed of 56 places in 237 ms
[2020-05-21 00:59:18] [INFO ] Deduced a trap composed of 42 places in 233 ms
[2020-05-21 00:59:18] [INFO ] Deduced a trap composed of 67 places in 249 ms
[2020-05-21 00:59:18] [INFO ] Deduced a trap composed of 46 places in 221 ms
[2020-05-21 00:59:18] [INFO ] Deduced a trap composed of 36 places in 228 ms
[2020-05-21 00:59:19] [INFO ] Deduced a trap composed of 35 places in 257 ms
[2020-05-21 00:59:19] [INFO ] Deduced a trap composed of 57 places in 256 ms
[2020-05-21 00:59:19] [INFO ] Deduced a trap composed of 39 places in 235 ms
[2020-05-21 00:59:19] [INFO ] Deduced a trap composed of 46 places in 249 ms
[2020-05-21 00:59:20] [INFO ] Deduced a trap composed of 27 places in 239 ms
[2020-05-21 00:59:20] [INFO ] Deduced a trap composed of 35 places in 238 ms
[2020-05-21 00:59:20] [INFO ] Deduced a trap composed of 37 places in 218 ms
[2020-05-21 00:59:20] [INFO ] Deduced a trap composed of 37 places in 221 ms
[2020-05-21 00:59:21] [INFO ] Deduced a trap composed of 44 places in 207 ms
[2020-05-21 00:59:21] [INFO ] Deduced a trap composed of 48 places in 196 ms
[2020-05-21 00:59:21] [INFO ] Deduced a trap composed of 29 places in 202 ms
[2020-05-21 00:59:21] [INFO ] Deduced a trap composed of 46 places in 193 ms
[2020-05-21 00:59:22] [INFO ] Deduced a trap composed of 37 places in 190 ms
[2020-05-21 00:59:22] [INFO ] Deduced a trap composed of 42 places in 156 ms
[2020-05-21 00:59:22] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-05-21 00:59:22] [INFO ] Deduced a trap composed of 53 places in 183 ms
[2020-05-21 00:59:22] [INFO ] Deduced a trap composed of 23 places in 177 ms
[2020-05-21 00:59:23] [INFO ] Deduced a trap composed of 21 places in 196 ms
[2020-05-21 00:59:23] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2020-05-21 00:59:23] [INFO ] Deduced a trap composed of 67 places in 210 ms
[2020-05-21 00:59:23] [INFO ] Deduced a trap composed of 13 places in 175 ms
[2020-05-21 00:59:24] [INFO ] Deduced a trap composed of 13 places in 180 ms
[2020-05-21 00:59:24] [INFO ] Deduced a trap composed of 44 places in 190 ms
[2020-05-21 00:59:24] [INFO ] Deduced a trap composed of 66 places in 181 ms
[2020-05-21 00:59:24] [INFO ] Deduced a trap composed of 13 places in 179 ms
[2020-05-21 00:59:24] [INFO ] Deduced a trap composed of 34 places in 172 ms
[2020-05-21 00:59:25] [INFO ] Deduced a trap composed of 42 places in 172 ms
[2020-05-21 00:59:25] [INFO ] Deduced a trap composed of 78 places in 176 ms
[2020-05-21 00:59:25] [INFO ] Deduced a trap composed of 89 places in 173 ms
[2020-05-21 00:59:25] [INFO ] Deduced a trap composed of 84 places in 187 ms
[2020-05-21 00:59:25] [INFO ] Deduced a trap composed of 58 places in 170 ms
[2020-05-21 00:59:26] [INFO ] Deduced a trap composed of 43 places in 178 ms
[2020-05-21 00:59:26] [INFO ] Deduced a trap composed of 57 places in 179 ms
[2020-05-21 00:59:26] [INFO ] Deduced a trap composed of 106 places in 179 ms
[2020-05-21 00:59:26] [INFO ] Deduced a trap composed of 53 places in 174 ms
[2020-05-21 00:59:26] [INFO ] Deduced a trap composed of 98 places in 189 ms
[2020-05-21 00:59:27] [INFO ] Deduced a trap composed of 58 places in 199 ms
[2020-05-21 00:59:27] [INFO ] Deduced a trap composed of 58 places in 197 ms
[2020-05-21 00:59:27] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2020-05-21 00:59:27] [INFO ] Deduced a trap composed of 12 places in 210 ms
[2020-05-21 00:59:28] [INFO ] Deduced a trap composed of 13 places in 216 ms
[2020-05-21 00:59:28] [INFO ] Deduced a trap composed of 14 places in 205 ms
[2020-05-21 00:59:28] [INFO ] Deduced a trap composed of 19 places in 215 ms
[2020-05-21 00:59:28] [INFO ] Deduced a trap composed of 29 places in 192 ms
[2020-05-21 00:59:29] [INFO ] Deduced a trap composed of 27 places in 184 ms
[2020-05-21 00:59:29] [INFO ] Deduced a trap composed of 29 places in 198 ms
[2020-05-21 00:59:29] [INFO ] Deduced a trap composed of 53 places in 167 ms
[2020-05-21 00:59:29] [INFO ] Deduced a trap composed of 36 places in 174 ms
[2020-05-21 00:59:29] [INFO ] Deduced a trap composed of 37 places in 157 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 55 places in 148 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 78 places in 164 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 60 places in 147 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 84 places in 140 ms
[2020-05-21 00:59:30] [INFO ] Deduced a trap composed of 46 places in 152 ms
[2020-05-21 00:59:31] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2020-05-21 00:59:31] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2020-05-21 00:59:31] [INFO ] Deduced a trap composed of 37 places in 196 ms
[2020-05-21 00:59:31] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-05-21 00:59:32] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-05-21 00:59:32] [INFO ] Deduced a trap composed of 42 places in 166 ms
[2020-05-21 00:59:32] [INFO ] Deduced a trap composed of 53 places in 154 ms
[2020-05-21 00:59:32] [INFO ] Deduced a trap composed of 51 places in 162 ms
[2020-05-21 00:59:32] [INFO ] Deduced a trap composed of 43 places in 149 ms
[2020-05-21 00:59:33] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-05-21 00:59:33] [INFO ] Deduced a trap composed of 29 places in 202 ms
[2020-05-21 00:59:33] [INFO ] Deduced a trap composed of 80 places in 187 ms
[2020-05-21 00:59:33] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2020-05-21 00:59:33] [INFO ] Deduced a trap composed of 52 places in 165 ms
[2020-05-21 00:59:34] [INFO ] Deduced a trap composed of 53 places in 170 ms
[2020-05-21 00:59:34] [INFO ] Deduced a trap composed of 55 places in 161 ms
[2020-05-21 00:59:34] [INFO ] Deduced a trap composed of 52 places in 98 ms
[2020-05-21 00:59:34] [INFO ] Deduced a trap composed of 51 places in 133 ms
[2020-05-21 00:59:34] [INFO ] Deduced a trap composed of 23 places in 226 ms
[2020-05-21 00:59:35] [INFO ] Deduced a trap composed of 44 places in 189 ms
[2020-05-21 00:59:35] [INFO ] Deduced a trap composed of 48 places in 221 ms
[2020-05-21 00:59:35] [INFO ] Deduced a trap composed of 37 places in 199 ms
[2020-05-21 00:59:35] [INFO ] Deduced a trap composed of 37 places in 202 ms
[2020-05-21 00:59:36] [INFO ] Deduced a trap composed of 29 places in 181 ms
[2020-05-21 00:59:36] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2020-05-21 00:59:36] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-05-21 00:59:36] [INFO ] Deduced a trap composed of 38 places in 187 ms
[2020-05-21 00:59:36] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-05-21 00:59:37] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-05-21 00:59:37] [INFO ] Deduced a trap composed of 45 places in 194 ms
[2020-05-21 00:59:37] [INFO ] Deduced a trap composed of 43 places in 192 ms
[2020-05-21 00:59:37] [INFO ] Deduced a trap composed of 41 places in 209 ms
[2020-05-21 00:59:38] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-05-21 00:59:38] [INFO ] Deduced a trap composed of 42 places in 191 ms
[2020-05-21 00:59:38] [INFO ] Deduced a trap composed of 11 places in 194 ms
[2020-05-21 00:59:38] [INFO ] Deduced a trap composed of 39 places in 205 ms
[2020-05-21 00:59:39] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2020-05-21 00:59:39] [INFO ] Deduced a trap composed of 15 places in 202 ms
[2020-05-21 00:59:39] [INFO ] Deduced a trap composed of 87 places in 222 ms
[2020-05-21 00:59:39] [INFO ] Deduced a trap composed of 23 places in 220 ms
[2020-05-21 00:59:40] [INFO ] Deduced a trap composed of 39 places in 191 ms
[2020-05-21 00:59:40] [INFO ] Deduced a trap composed of 69 places in 238 ms
[2020-05-21 00:59:40] [INFO ] Deduced a trap composed of 36 places in 250 ms
[2020-05-21 00:59:40] [INFO ] Deduced a trap composed of 30 places in 223 ms
[2020-05-21 00:59:41] [INFO ] Deduced a trap composed of 69 places in 214 ms
[2020-05-21 00:59:41] [INFO ] Deduced a trap composed of 61 places in 230 ms
[2020-05-21 00:59:41] [INFO ] Deduced a trap composed of 34 places in 192 ms
[2020-05-21 00:59:41] [INFO ] Deduced a trap composed of 61 places in 220 ms
[2020-05-21 00:59:42] [INFO ] Deduced a trap composed of 26 places in 209 ms
[2020-05-21 00:59:42] [INFO ] Deduced a trap composed of 73 places in 207 ms
[2020-05-21 00:59:42] [INFO ] Deduced a trap composed of 31 places in 207 ms
[2020-05-21 00:59:42] [INFO ] Deduced a trap composed of 31 places in 199 ms
[2020-05-21 00:59:42] [INFO ] Deduced a trap composed of 39 places in 210 ms
[2020-05-21 00:59:43] [INFO ] Deduced a trap composed of 37 places in 205 ms
[2020-05-21 00:59:43] [INFO ] Deduced a trap composed of 45 places in 207 ms
[2020-05-21 00:59:43] [INFO ] Deduced a trap composed of 18 places in 230 ms
[2020-05-21 00:59:43] [INFO ] Deduced a trap composed of 18 places in 180 ms
[2020-05-21 00:59:44] [INFO ] Deduced a trap composed of 38 places in 238 ms
[2020-05-21 00:59:44] [INFO ] Deduced a trap composed of 39 places in 206 ms
[2020-05-21 00:59:44] [INFO ] Deduced a trap composed of 25 places in 168 ms
[2020-05-21 00:59:44] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-05-21 00:59:45] [INFO ] Deduced a trap composed of 80 places in 188 ms
[2020-05-21 00:59:45] [INFO ] Deduced a trap composed of 43 places in 190 ms
[2020-05-21 00:59:45] [INFO ] Deduced a trap composed of 47 places in 172 ms
[2020-05-21 00:59:45] [INFO ] Deduced a trap composed of 47 places in 198 ms
[2020-05-21 00:59:46] [INFO ] Deduced a trap composed of 35 places in 193 ms
[2020-05-21 00:59:46] [INFO ] Deduced a trap composed of 23 places in 176 ms
[2020-05-21 00:59:46] [INFO ] Deduced a trap composed of 37 places in 197 ms
[2020-05-21 00:59:46] [INFO ] Deduced a trap composed of 55 places in 271 ms
[2020-05-21 00:59:47] [INFO ] Deduced a trap composed of 39 places in 192 ms
[2020-05-21 00:59:47] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-05-21 00:59:47] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-05-21 00:59:47] [INFO ] Deduced a trap composed of 28 places in 204 ms
[2020-05-21 00:59:48] [INFO ] Deduced a trap composed of 35 places in 184 ms
[2020-05-21 00:59:48] [INFO ] Deduced a trap composed of 52 places in 239 ms
[2020-05-21 00:59:48] [INFO ] Deduced a trap composed of 11 places in 223 ms
[2020-05-21 00:59:48] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-05-21 00:59:49] [INFO ] Deduced a trap composed of 89 places in 190 ms
[2020-05-21 00:59:49] [INFO ] Deduced a trap composed of 113 places in 192 ms
[2020-05-21 00:59:49] [INFO ] Deduced a trap composed of 82 places in 202 ms
[2020-05-21 00:59:49] [INFO ] Deduced a trap composed of 100 places in 202 ms
[2020-05-21 00:59:50] [INFO ] Deduced a trap composed of 38 places in 196 ms
[2020-05-21 00:59:50] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-05-21 00:59:50] [INFO ] Deduced a trap composed of 20 places in 186 ms
[2020-05-21 00:59:50] [INFO ] Deduced a trap composed of 58 places in 168 ms
[2020-05-21 00:59:50] [INFO ] Deduced a trap composed of 45 places in 175 ms
[2020-05-21 00:59:51] [INFO ] Deduced a trap composed of 45 places in 176 ms
[2020-05-21 00:59:51] [INFO ] Deduced a trap composed of 31 places in 225 ms
[2020-05-21 00:59:51] [INFO ] Deduced a trap composed of 52 places in 205 ms
[2020-05-21 00:59:51] [INFO ] Deduced a trap composed of 47 places in 164 ms
[2020-05-21 00:59:52] [INFO ] Deduced a trap composed of 52 places in 137 ms
[2020-05-21 00:59:52] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2020-05-21 00:59:52] [INFO ] Deduced a trap composed of 31 places in 190 ms
[2020-05-21 00:59:52] [INFO ] Deduced a trap composed of 73 places in 105 ms
[2020-05-21 00:59:52] [INFO ] Deduced a trap composed of 55 places in 131 ms
[2020-05-21 00:59:53] [INFO ] Deduced a trap composed of 13 places in 126 ms
[2020-05-21 00:59:53] [INFO ] Deduced a trap composed of 30 places in 108 ms
[2020-05-21 00:59:53] [INFO ] Deduced a trap composed of 11 places in 123 ms
[2020-05-21 00:59:53] [INFO ] Deduced a trap composed of 68 places in 226 ms
[2020-05-21 00:59:53] [INFO ] Deduced a trap composed of 18 places in 201 ms
[2020-05-21 00:59:54] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-05-21 00:59:54] [INFO ] Deduced a trap composed of 46 places in 141 ms
[2020-05-21 00:59:54] [INFO ] Deduced a trap composed of 46 places in 142 ms
[2020-05-21 00:59:54] [INFO ] Deduced a trap composed of 54 places in 143 ms
[2020-05-21 00:59:54] [INFO ] Deduced a trap composed of 47 places in 109 ms
[2020-05-21 00:59:55] [INFO ] Deduced a trap composed of 46 places in 164 ms
[2020-05-21 00:59:55] [INFO ] Deduced a trap composed of 28 places in 212 ms
[2020-05-21 00:59:55] [INFO ] Deduced a trap composed of 20 places in 207 ms
[2020-05-21 00:59:55] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-05-21 00:59:56] [INFO ] Deduced a trap composed of 31 places in 186 ms
[2020-05-21 00:59:56] [INFO ] Deduced a trap composed of 54 places in 205 ms
[2020-05-21 00:59:56] [INFO ] Deduced a trap composed of 26 places in 176 ms
[2020-05-21 00:59:56] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2020-05-21 00:59:57] [INFO ] Deduced a trap composed of 55 places in 128 ms
[2020-05-21 00:59:57] [INFO ] Deduced a trap composed of 55 places in 166 ms
[2020-05-21 00:59:57] [INFO ] Deduced a trap composed of 55 places in 114 ms
[2020-05-21 00:59:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s10 s19 s56 s57 s58 s60 s61 s62 s86 s93 s94 s95 s96 s97 s128 s135 s136 s137 s138 s139 s177 s178 s179 s180 s181 s187 s311 s312 s313 s314 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370) 0)") while checking expression at index 0
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 23 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-05-21 00:59:57] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 00:59:57] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 00:59:58] [INFO ] Implicit Places using invariants in 666 ms returned []
[2020-05-21 00:59:58] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 00:59:58] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-21 00:59:58] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 01:00:04] [INFO ] Implicit Places using invariants and state equation in 6565 ms returned []
Implicit Place search using SMT with State Equation took 7233 ms to find 0 implicit places.
[2020-05-21 01:00:04] [INFO ] Redundant transitions in 13 ms returned []
[2020-05-21 01:00:04] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 01:00:04] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 01:00:06] [INFO ] Dead Transitions using invariants and state equation in 1433 ms returned []
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1113/1113 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 232 ms. (steps per millisecond=431 ) properties seen :[0]
[2020-05-21 01:00:06] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 01:00:06] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-21 01:00:06] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 01:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:07] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2020-05-21 01:00:07] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 01:00:07] [INFO ] [Real]Added 366 Read/Feed constraints in 100 ms returned sat
[2020-05-21 01:00:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:00:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-21 01:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:08] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2020-05-21 01:00:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 56 ms returned sat
[2020-05-21 01:00:08] [INFO ] Deduced a trap composed of 22 places in 223 ms
[2020-05-21 01:00:08] [INFO ] Deduced a trap composed of 37 places in 240 ms
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 21 places in 227 ms
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 30 places in 236 ms
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 40 places in 198 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 65 places in 245 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 55 places in 241 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 44 places in 248 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 51 places in 286 ms
[2020-05-21 01:00:11] [INFO ] Deduced a trap composed of 47 places in 249 ms
[2020-05-21 01:00:11] [INFO ] Deduced a trap composed of 48 places in 235 ms
[2020-05-21 01:00:11] [INFO ] Deduced a trap composed of 26 places in 219 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 55 places in 229 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 28 places in 243 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 56 places in 278 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 42 places in 239 ms
[2020-05-21 01:00:13] [INFO ] Deduced a trap composed of 67 places in 246 ms
[2020-05-21 01:00:13] [INFO ] Deduced a trap composed of 46 places in 219 ms
[2020-05-21 01:00:13] [INFO ] Deduced a trap composed of 36 places in 246 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 35 places in 274 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 57 places in 261 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 39 places in 238 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 46 places in 229 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 27 places in 199 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 35 places in 202 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 37 places in 213 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 44 places in 233 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 48 places in 225 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 29 places in 282 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 46 places in 249 ms
[2020-05-21 01:00:17] [INFO ] Deduced a trap composed of 37 places in 204 ms
[2020-05-21 01:00:17] [INFO ] Deduced a trap composed of 42 places in 172 ms
[2020-05-21 01:00:17] [INFO ] Deduced a trap composed of 23 places in 192 ms
[2020-05-21 01:00:17] [INFO ] Deduced a trap composed of 53 places in 279 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 21 places in 250 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 19 places in 198 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 67 places in 223 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 13 places in 204 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 13 places in 182 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 44 places in 222 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 66 places in 198 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 13 places in 212 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 34 places in 171 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 42 places in 220 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 78 places in 193 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 89 places in 190 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 84 places in 213 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 58 places in 209 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 43 places in 229 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 57 places in 235 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 106 places in 209 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 53 places in 214 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 98 places in 223 ms
[2020-05-21 01:00:23] [INFO ] Deduced a trap composed of 58 places in 239 ms
[2020-05-21 01:00:23] [INFO ] Deduced a trap composed of 58 places in 220 ms
[2020-05-21 01:00:23] [INFO ] Deduced a trap composed of 22 places in 250 ms
[2020-05-21 01:00:23] [INFO ] Deduced a trap composed of 12 places in 216 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 13 places in 211 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 14 places in 212 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 29 places in 199 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 27 places in 179 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 53 places in 180 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 36 places in 192 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 37 places in 198 ms
[2020-05-21 01:00:26] [INFO ] Deduced a trap composed of 55 places in 194 ms
[2020-05-21 01:00:26] [INFO ] Deduced a trap composed of 78 places in 186 ms
[2020-05-21 01:00:26] [INFO ] Deduced a trap composed of 47 places in 215 ms
[2020-05-21 01:00:26] [INFO ] Deduced a trap composed of 60 places in 174 ms
[2020-05-21 01:00:27] [INFO ] Deduced a trap composed of 84 places in 191 ms
[2020-05-21 01:00:27] [INFO ] Deduced a trap composed of 46 places in 175 ms
[2020-05-21 01:00:27] [INFO ] Deduced a trap composed of 35 places in 204 ms
[2020-05-21 01:00:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s2 s4 s15 s16 s21 s22 s24 s25 s26 s27 s75 s76 s77 s78 s79 s80 s117 s118 s119 s120 s121 s122 s159 s160 s161 s162 s163 s164 s191 s256 s261 s266 s271 s276 s281) 0)") while checking expression at index 0
Graph (trivial) has 840 edges and 406 vertex of which 294 / 406 are part of one of the 42 SCC in 27 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 756 transitions.
Iterating post reduction 0 with 756 rules applied. Total rules applied 757 place count 154 transition count 357
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 757 place count 154 transition count 315
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 84 rules applied. Total rules applied 841 place count 112 transition count 315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 862 place count 98 transition count 308
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 869 place count 98 transition count 308
Applied a total of 869 rules in 49 ms. Remains 98 /406 variables (removed 308) and now considering 308/1113 (removed 805) transitions.
// Phase 1: matrix 308 rows 98 cols
[2020-05-21 01:00:27] [INFO ] Computed 13 place invariants in 2 ms
[2020-05-21 01:00:27] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2020-05-21 01:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:27] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-21 01:00:27] [INFO ] Computed and/alt/rep : 295/3067/295 causal constraints in 32 ms.
[2020-05-21 01:00:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:00:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2020-05-21 01:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:28] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-05-21 01:00:28] [INFO ] Computed and/alt/rep : 295/3067/295 causal constraints in 29 ms.
[2020-05-21 01:00:31] [INFO ] Added : 289 causal constraints over 58 iterations in 3381 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-05-21 01:00:31] [INFO ] Flatten gal took : 319 ms
Using solver Z3 to compute partial order matrices.
[2020-05-21 01:00:32] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-21 01:00:32] [INFO ] Flatten gal took : 215 ms
[2020-05-21 01:00:32] [INFO ] Flatten gal took : 269 ms
[2020-05-21 01:00:32] [INFO ] Input system was already deterministic with 1113 transitions.
[2020-05-21 01:00:33] [INFO ] Ran tautology test, simplified 0 / 1 in 1291 ms.
[2020-05-21 01:00:33] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=0 took 76 ms
[2020-05-21 01:00:34] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=1 took 95 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 903 out of 1113 initially.
// Phase 1: matrix 903 rows 406 cols
[2020-05-21 01:00:34] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=2 took 691 ms
[2020-05-21 01:00:34] [INFO ] Computed 20 place invariants in 2 ms
inv : wantSection_12 + askForSection_36 + testTurn_36 + testTurn_37 + testTurn_38 + testTurn_39 + testTurn_40 + testTurn_41 + beginLoop_252 + beginLoop_259 + beginLoop_266 + beginLoop_273 + beginLoop_280 + beginLoop_287 + endTurn_36 + endTurn_37 + endTurn_38 + endTurn_39 + endTurn_40 + endTurn_41 + CS_6 + isEndLoop_252 + isEndLoop_253 + isEndLoop_254 + isEndLoop_255 + isEndLoop_256 + isEndLoop_259 + isEndLoop_260 + isEndLoop_261 + isEndLoop_262 + isEndLoop_263 + isEndLoop_266 + isEndLoop_267 + isEndLoop_268 + isEndLoop_269 + isEndLoop_270 + isEndLoop_273 + isEndLoop_274 + isEndLoop_275 + isEndLoop_276 + isEndLoop_277 + isEndLoop_280 + isEndLoop_281 + isEndLoop_282 + isEndLoop_283 + isEndLoop_284 + isEndLoop_287 + isEndLoop_288 + isEndLoop_289 + isEndLoop_290 + isEndLoop_291 = 1
inv : wantSection_4 + wantSection_5 = 1
inv : wantSection_8 + wantSection_9 = 1
inv : wantSection_8 + askForSection_24 + testTurn_24 + testTurn_25 + testTurn_26 + testTurn_27 + testTurn_28 + testTurn_29 + beginLoop_168 + beginLoop_175 + beginLoop_182 + beginLoop_189 + beginLoop_196 + beginLoop_203 + endTurn_24 + endTurn_25 + endTurn_26 + endTurn_27 + endTurn_28 + endTurn_29 + CS_4 + isEndLoop_168 + isEndLoop_169 + isEndLoop_170 + isEndLoop_171 + isEndLoop_173 + isEndLoop_175 + isEndLoop_176 + isEndLoop_177 + isEndLoop_178 + isEndLoop_180 + isEndLoop_182 + isEndLoop_183 + isEndLoop_184 + isEndLoop_185 + isEndLoop_187 + isEndLoop_189 + isEndLoop_190 + isEndLoop_191 + isEndLoop_192 + isEndLoop_194 + isEndLoop_196 + isEndLoop_197 + isEndLoop_198 + isEndLoop_199 + isEndLoop_201 + isEndLoop_203 + isEndLoop_204 + isEndLoop_205 + isEndLoop_206 + isEndLoop_208 = 1
inv : wantSection_0 + wantSection_1 = 1
inv : turn_7 + turn_8 + turn_9 + turn_10 + turn_11 + turn_12 + turn_13 = 1
inv : turn_14 + turn_15 + turn_16 + turn_17 + turn_18 + turn_19 + turn_20 = 1
inv : turn_0 + turn_1 + turn_2 + turn_3 + turn_4 + turn_5 + turn_6 = 1
inv : wantSection_12 + wantSection_13 = 1
inv : wantSection_10 + askForSection_30 + testTurn_30 + testTurn_31 + testTurn_32 + testTurn_33 + testTurn_34 + testTurn_35 + beginLoop_210 + beginLoop_217 + beginLoop_224 + beginLoop_231 + beginLoop_238 + beginLoop_245 + endTurn_30 + endTurn_31 + endTurn_32 + endTurn_33 + endTurn_34 + endTurn_35 + CS_5 + isEndLoop_210 + isEndLoop_211 + isEndLoop_212 + isEndLoop_213 + isEndLoop_214 + isEndLoop_217 + isEndLoop_218 + isEndLoop_219 + isEndLoop_220 + isEndLoop_221 + isEndLoop_224 + isEndLoop_225 + isEndLoop_226 + isEndLoop_227 + isEndLoop_228 + isEndLoop_231 + isEndLoop_232 + isEndLoop_233 + isEndLoop_234 + isEndLoop_235 + isEndLoop_238 + isEndLoop_239 + isEndLoop_240 + isEndLoop_241 + isEndLoop_242 + isEndLoop_245 + isEndLoop_246 + isEndLoop_247 + isEndLoop_248 + isEndLoop_249 = 1
inv : wantSection_6 + wantSection_7 = 1
inv : turn_35 + turn_36 + turn_37 + turn_38 + turn_39 + turn_40 + turn_41 = 1
inv : wantSection_6 + askForSection_18 + testTurn_18 + testTurn_19 + testTurn_20 + testTurn_21 + testTurn_22 + testTurn_23 + beginLoop_126 + beginLoop_133 + beginLoop_140 + beginLoop_147 + beginLoop_154 + beginLoop_161 + endTurn_18 + endTurn_19 + endTurn_20 + endTurn_21 + endTurn_22 + endTurn_23 + CS_3 + isEndLoop_126 + isEndLoop_127 + isEndLoop_128 + isEndLoop_130 + isEndLoop_131 + isEndLoop_133 + isEndLoop_134 + isEndLoop_135 + isEndLoop_137 + isEndLoop_138 + isEndLoop_140 + isEndLoop_141 + isEndLoop_142 + isEndLoop_144 + isEndLoop_145 + isEndLoop_147 + isEndLoop_148 + isEndLoop_149 + isEndLoop_151 + isEndLoop_152 + isEndLoop_154 + isEndLoop_155 + isEndLoop_156 + isEndLoop_158 + isEndLoop_159 + isEndLoop_161 + isEndLoop_162 + isEndLoop_163 + isEndLoop_165 + isEndLoop_166 = 1
inv : turn_21 + turn_22 + turn_23 + turn_24 + turn_25 + turn_26 + turn_27 = 1
inv : wantSection_2 + wantSection_3 = 1
inv : wantSection_10 + wantSection_11 = 1
inv : turn_28 + turn_29 + turn_30 + turn_31 + turn_32 + turn_33 + turn_34 = 1
inv : wantSection_0 + askForSection_0 + testTurn_0 + testTurn_1 + testTurn_2 + testTurn_3 + testTurn_4 + testTurn_5 + beginLoop_0 + beginLoop_7 + beginLoop_14 + beginLoop_21 + beginLoop_28 + beginLoop_35 + endTurn_0 + endTurn_1 + endTurn_2 + endTurn_3 + endTurn_4 + endTurn_5 + CS_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_5 + isEndLoop_8 + isEndLoop_9 + isEndLoop_10 + isEndLoop_11 + isEndLoop_12 + isEndLoop_15 + isEndLoop_16 + isEndLoop_17 + isEndLoop_18 + isEndLoop_19 + isEndLoop_22 + isEndLoop_23 + isEndLoop_24 + isEndLoop_25 + isEndLoop_26 + isEndLoop_29 + isEndLoop_30 + isEndLoop_31 + isEndLoop_32 + isEndLoop_33 + isEndLoop_36 + isEndLoop_37 + isEndLoop_38 + isEndLoop_39 + isEndLoop_40 = 1
inv : wantSection_4 + askForSection_12 + testTurn_12 + testTurn_13 + testTurn_14 + testTurn_15 + testTurn_16 + testTurn_17 + beginLoop_84 + beginLoop_91 + beginLoop_98 + beginLoop_105 + beginLoop_112 + beginLoop_119 + endTurn_12 + endTurn_13 + endTurn_14 + endTurn_15 + endTurn_16 + endTurn_17 + CS_2 + isEndLoop_84 + isEndLoop_85 + isEndLoop_87 + isEndLoop_88 + isEndLoop_89 + isEndLoop_91 + isEndLoop_92 + isEndLoop_94 + isEndLoop_95 + isEndLoop_96 + isEndLoop_98 + isEndLoop_99 + isEndLoop_101 + isEndLoop_102 + isEndLoop_103 + isEndLoop_105 + isEndLoop_106 + isEndLoop_108 + isEndLoop_109 + isEndLoop_110 + isEndLoop_112 + isEndLoop_113 + isEndLoop_115 + isEndLoop_116 + isEndLoop_117 + isEndLoop_119 + isEndLoop_120 + isEndLoop_122 + isEndLoop_123 + isEndLoop_124 = 1
inv : wantSection_2 + askForSection_6 + testTurn_6 + testTurn_7 + testTurn_8 + testTurn_9 + testTurn_10 + testTurn_11 + beginLoop_42 + beginLoop_49 + beginLoop_56 + beginLoop_63 + beginLoop_70 + beginLoop_77 + endTurn_6 + endTurn_7 + endTurn_8 + endTurn_9 + endTurn_10 + endTurn_11 + CS_1 + isEndLoop_42 + isEndLoop_44 + isEndLoop_45 + isEndLoop_46 + isEndLoop_47 + isEndLoop_49 + isEndLoop_51 + isEndLoop_52 + isEndLoop_53 + isEndLoop_54 + isEndLoop_56 + isEndLoop_58 + isEndLoop_59 + isEndLoop_60 + isEndLoop_61 + isEndLoop_63 + isEndLoop_65 + isEndLoop_66 + isEndLoop_67 + isEndLoop_68 + isEndLoop_70 + isEndLoop_72 + isEndLoop_73 + isEndLoop_74 + isEndLoop_75 + isEndLoop_77 + isEndLoop_79 + isEndLoop_80 + isEndLoop_81 + isEndLoop_82 = 1
Total of 20 invariants.
[2020-05-21 01:00:34] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-21 01:00:36] [INFO ] Proved 406 variables to be positive in 2183 ms
[2020-05-21 01:00:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:00:36] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=0 took 100 ms
[2020-05-21 01:00:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:00:37] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=1 took 531 ms
[2020-05-21 01:00:51] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=3 took 16305 ms
[2020-05-21 01:01:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:01:58] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=2 took 80635 ms
[2020-05-21 01:03:52] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=4 took 181267 ms
[2020-05-21 01:08:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:08:57] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=3 took 419268 ms
[2020-05-21 01:10:41] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=5 took 409035 ms
[2020-05-21 01:20:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:20:04] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=4 took 667281 ms
[2020-05-21 01:33:02] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityCardinality-14(UNSAT) depth K=6 took 1341293 ms
[2020-05-21 01:40:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityCardinality-14
[2020-05-21 01:40:55] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityCardinality-14(SAT) depth K=5 took 1250761 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Peterson-COL-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itstools"
echo " Input is Peterson-COL-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258000694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;