Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r151-smll-167819438100297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DoubleExponent-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-167819438100297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678391503192

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 19:51:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 19:51:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:51:46] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-09 19:51:46] [INFO ] Transformed 534 places.
[2023-03-09 19:51:46] [INFO ] Transformed 498 transitions.
[2023-03-09 19:51:46] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 204 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 530 transition count 378
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 244 place count 410 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 410 transition count 358
Deduced a syphon composed of 20 places in 22 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 390 transition count 358
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 4 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 472 place count 296 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 278 transition count 264
Applied a total of 508 rules in 105 ms. Remains 278 /534 variables (removed 256) and now considering 264/498 (removed 234) transitions.
// Phase 1: matrix 264 rows 278 cols
[2023-03-09 19:51:46] [INFO ] Computed 51 place invariants in 44 ms
[2023-03-09 19:51:46] [INFO ] Implicit Places using invariants in 548 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 589 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 276/534 places, 264/498 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 272 transition count 260
Applied a total of 8 rules in 14 ms. Remains 272 /276 variables (removed 4) and now considering 260/264 (removed 4) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 19:51:46] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 19:51:47] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-09 19:51:47] [INFO ] Invariant cache hit.
[2023-03-09 19:51:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 19:51:48] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/534 places, 260/498 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2562 ms. Remains : 272/534 places, 260/498 transitions.
Discarding 58 transitions out of 260. Remains 202
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1218 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 201) seen :14
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Interrupted probabilistic random walk after 92731 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{0=1, 1=1, 4=1, 8=1, 9=1, 10=1, 11=1, 26=1, 89=1, 100=1, 101=1, 102=1, 103=1, 104=1, 105=1, 106=1, 107=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 114=1, 146=1, 147=1, 148=1, 149=1, 150=1, 162=1, 171=1, 180=1, 181=1, 182=1, 183=1}
Probabilistic random walk after 92731 steps, saw 46382 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :35
Running SMT prover for 152 properties.
[2023-03-09 19:51:53] [INFO ] Invariant cache hit.
[2023-03-09 19:51:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 19:51:54] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-09 19:51:58] [INFO ] After 3277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:149
[2023-03-09 19:51:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 19:51:58] [INFO ] After 142ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 19:51:58] [INFO ] After 5600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 19:51:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 19:51:59] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-09 19:52:04] [INFO ] After 3028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :152
[2023-03-09 19:52:10] [INFO ] After 6546ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :152
[2023-03-09 19:52:10] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 11 ms to minimize.
[2023-03-09 19:52:10] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 7 ms to minimize.
[2023-03-09 19:52:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-03-09 19:52:11] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2023-03-09 19:52:11] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-09 19:52:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 753 ms
[2023-03-09 19:52:12] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-09 19:52:12] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-09 19:52:12] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-09 19:52:12] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-09 19:52:12] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-09 19:52:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 669 ms
[2023-03-09 19:52:13] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2023-03-09 19:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-09 19:52:13] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2023-03-09 19:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-09 19:52:14] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-09 19:52:14] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2023-03-09 19:52:14] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-03-09 19:52:14] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-09 19:52:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 577 ms
[2023-03-09 19:52:15] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2023-03-09 19:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-09 19:52:16] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2023-03-09 19:52:16] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2023-03-09 19:52:16] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2023-03-09 19:52:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2023-03-09 19:52:16] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-09 19:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-09 19:52:17] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-09 19:52:17] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-09 19:52:17] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2023-03-09 19:52:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2023-03-09 19:52:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-09 19:52:18] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-09 19:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-09 19:52:19] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2023-03-09 19:52:19] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2023-03-09 19:52:19] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2023-03-09 19:52:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2023-03-09 19:52:20] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2023-03-09 19:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 19:52:20] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2023-03-09 19:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 19:52:23] [INFO ] After 19605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :151
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 19:52:23] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :151
Parikh walk visited 0 properties in 30286 ms.
Support contains 208 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 255
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 267 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 266 transition count 254
Applied a total of 19 rules in 71 ms. Remains 266 /272 variables (removed 6) and now considering 254/260 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 266/272 places, 254/260 transitions.
Interrupted random walk after 731990 steps, including 93851 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Probably explored full state space saw : 430257 states, properties seen :7
Probabilistic random walk after 860541 steps, saw 430257 distinct states, run finished after 21885 ms. (steps per millisecond=39 ) properties seen :7
Interrupted probabilistic random walk after 5149150 steps, run timeout after 132001 ms. (steps per millisecond=39 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 10=1, 11=1, 12=1, 13=1, 87=1, 88=1, 116=1, 117=1, 118=1}
Exhaustive walk after 5149150 steps, saw 2574786 distinct states, run finished after 132003 ms. (steps per millisecond=39 ) properties seen :14
Running SMT prover for 131 properties.
// Phase 1: matrix 254 rows 266 cols
[2023-03-09 19:56:12] [INFO ] Computed 49 place invariants in 15 ms
[2023-03-09 19:56:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 19:56:13] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 19:56:17] [INFO ] After 2921ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 19:56:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 19:56:17] [INFO ] After 133ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 19:56:17] [INFO ] After 5190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 19:56:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 19:56:18] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-09 19:56:22] [INFO ] After 2682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 19:56:26] [INFO ] After 3846ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 19:56:26] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-09 19:56:26] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-09 19:56:26] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-09 19:56:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2023-03-09 19:56:30] [INFO ] After 8732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4172 ms.
[2023-03-09 19:56:35] [INFO ] After 17199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30071 ms.
Support contains 180 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 254/254 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 266 transition count 250
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 262 transition count 250
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 262 transition count 250
Applied a total of 12 rules in 33 ms. Remains 262 /266 variables (removed 4) and now considering 250/254 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 262/266 places, 250/254 transitions.
Interrupted random walk after 822211 steps, including 105192 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5386990 steps, run timeout after 123001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 5386990 steps, saw 2693257 distinct states, run finished after 123004 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 131 properties.
// Phase 1: matrix 250 rows 262 cols
[2023-03-09 19:59:49] [INFO ] Computed 49 place invariants in 22 ms
[2023-03-09 19:59:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 19:59:50] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-09 19:59:56] [INFO ] After 4393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 19:59:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 19:59:56] [INFO ] After 200ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 19:59:56] [INFO ] After 7026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 19:59:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 19:59:57] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 20:00:00] [INFO ] After 2398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 20:00:04] [INFO ] After 3970ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 20:00:04] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-09 20:00:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 20:00:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-09 20:00:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 20:00:05] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-03-09 20:00:05] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:00:05] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:00:05] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-09 20:00:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2023-03-09 20:00:05] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-09 20:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2023-03-09 20:00:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-09 20:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 20:00:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2023-03-09 20:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 20:00:07] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 20:00:07] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2023-03-09 20:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 20:00:08] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2023-03-09 20:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 20:00:08] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2023-03-09 20:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 20:00:08] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2023-03-09 20:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-09 20:00:08] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:00:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:00:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-09 20:00:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 20:00:11] [INFO ] After 10679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4526 ms.
[2023-03-09 20:00:15] [INFO ] After 19225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30428 ms.
Support contains 180 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 262/262 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 20:00:46] [INFO ] Invariant cache hit.
[2023-03-09 20:00:46] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 20:00:46] [INFO ] Invariant cache hit.
[2023-03-09 20:00:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:00:47] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned [20, 214, 253, 259]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1428 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 258/262 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 258 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 249
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 257 transition count 249
Applied a total of 4 rules in 34 ms. Remains 257 /258 variables (removed 1) and now considering 249/250 (removed 1) transitions.
// Phase 1: matrix 249 rows 257 cols
[2023-03-09 20:00:47] [INFO ] Computed 45 place invariants in 16 ms
[2023-03-09 20:00:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-09 20:00:47] [INFO ] Invariant cache hit.
[2023-03-09 20:00:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:00:48] [INFO ] Implicit Places using invariants and state equation in 619 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 779 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/262 places, 249/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 248
Applied a total of 2 rules in 19 ms. Remains 255 /256 variables (removed 1) and now considering 248/249 (removed 1) transitions.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:00:48] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:00:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 20:00:48] [INFO ] Invariant cache hit.
[2023-03-09 20:00:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:00:49] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/262 places, 248/250 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2983 ms. Remains : 255/262 places, 248/250 transitions.
Interrupted random walk after 607417 steps, including 87792 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 887 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 6955188 steps, run timeout after 162001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 6955188 steps, saw 3476914 distinct states, run finished after 162003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 20:04:25] [INFO ] Invariant cache hit.
[2023-03-09 20:04:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:04:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 20:04:32] [INFO ] After 4551ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:130
[2023-03-09 20:04:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:04:32] [INFO ] After 143ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 20:04:32] [INFO ] After 7078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 20:04:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:04:33] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 20:04:39] [INFO ] After 3977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 20:04:45] [INFO ] After 6377ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-09 20:04:47] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2023-03-09 20:04:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 598 ms
[2023-03-09 20:04:47] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-09 20:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 4 ms to minimize.
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2023-03-09 20:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 19 ms to minimize.
[2023-03-09 20:04:49] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-09 20:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2023-03-09 20:04:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2023-03-09 20:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 20:04:53] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 20:04:55] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-09 20:04:55] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 20:04:56] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 3 ms to minimize.
[2023-03-09 20:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 20:04:56] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2023-03-09 20:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 20:04:56] [INFO ] After 17751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 7408 ms.
[2023-03-09 20:05:04] [INFO ] After 31626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30091 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 20:05:34] [INFO ] Invariant cache hit.
[2023-03-09 20:05:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 20:05:34] [INFO ] Invariant cache hit.
[2023-03-09 20:05:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:05:35] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-09 20:05:35] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 20:05:35] [INFO ] Invariant cache hit.
[2023-03-09 20:05:35] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1506 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14329 resets, run finished after 5206 ms. (steps per millisecond=19 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 20:05:41] [INFO ] Invariant cache hit.
[2023-03-09 20:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:05:41] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 20:05:42] [INFO ] After 713ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 20:05:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:05:43] [INFO ] After 1093ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 20:05:44] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-09 20:05:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-09 20:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-09 20:05:48] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:05:52] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:05:52] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-09 20:05:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-09 20:05:53] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2023-03-09 20:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 20:05:53] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2023-03-09 20:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 20:05:53] [INFO ] After 11131ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 20:05:53] [INFO ] After 12285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 20:05:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:05:53] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 20:05:54] [INFO ] After 966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 20:05:56] [INFO ] After 1471ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 20:05:57] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-09 20:05:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-09 20:05:57] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-09 20:05:58] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-09 20:06:01] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-09 20:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-09 20:06:05] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-09 20:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 20:06:06] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2023-03-09 20:06:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-09 20:06:06] [INFO ] After 11318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 1848 ms.
[2023-03-09 20:06:08] [INFO ] After 14544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Interrupted random walk after 757208 steps, including 109356 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 4577099 steps, run timeout after 123001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 4577099 steps, saw 2288301 distinct states, run finished after 123002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 20:08:52] [INFO ] Invariant cache hit.
[2023-03-09 20:08:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 20:08:56] [INFO ] After 2879ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:130
[2023-03-09 20:08:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:08:56] [INFO ] After 91ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 20:08:56] [INFO ] After 4634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 20:08:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:09:00] [INFO ] After 2572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 20:09:05] [INFO ] After 4140ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 20:09:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2023-03-09 20:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-09 20:09:05] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-09 20:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-09 20:09:05] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:09:06] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:09:06] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 0 ms to minimize.
[2023-03-09 20:09:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-09 20:09:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 639 ms
[2023-03-09 20:09:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 20:09:07] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2023-03-09 20:09:07] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-09 20:09:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-03-09 20:09:07] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-09 20:09:07] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-09 20:09:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-03-09 20:09:08] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 20:09:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-09 20:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 20:09:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2023-03-09 20:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 20:09:09] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-09 20:09:09] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-09 20:09:09] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2023-03-09 20:09:09] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2023-03-09 20:09:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 281 ms
[2023-03-09 20:09:09] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-09 20:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 20:09:10] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2023-03-09 20:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 20:09:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-09 20:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 20:09:12] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-09 20:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 20:09:12] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 20:09:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-09 20:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 20:09:12] [INFO ] After 11944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 5222 ms.
[2023-03-09 20:09:18] [INFO ] After 21284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30229 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 20:09:48] [INFO ] Invariant cache hit.
[2023-03-09 20:09:48] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-09 20:09:48] [INFO ] Invariant cache hit.
[2023-03-09 20:09:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:09:49] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-09 20:09:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 20:09:49] [INFO ] Invariant cache hit.
[2023-03-09 20:09:49] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1077 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14281 resets, run finished after 5473 ms. (steps per millisecond=18 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 20:09:54] [INFO ] Invariant cache hit.
[2023-03-09 20:09:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:09:55] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:09:55] [INFO ] After 760ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 20:09:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:09:57] [INFO ] After 1183ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 20:09:57] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 20:09:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-09 20:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 20:10:00] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2023-03-09 20:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 20:10:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-09 20:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 20:10:01] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-09 20:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 20:10:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-09 20:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 20:10:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-03-09 20:10:02] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:10:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-03-09 20:10:03] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 20:10:03] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2023-03-09 20:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 20:10:03] [INFO ] After 7676ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 20:10:03] [INFO ] After 8667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 20:10:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:10:03] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:10:04] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 20:10:05] [INFO ] After 1276ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 20:10:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-09 20:10:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-09 20:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 20:10:06] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-09 20:10:06] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-09 20:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 20:10:07] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-03-09 20:10:07] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:10:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-03-09 20:10:07] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 20:10:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2023-03-09 20:10:08] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:10:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-09 20:10:08] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2023-03-09 20:10:08] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:10:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-09 20:10:09] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-09 20:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 20:10:10] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2023-03-09 20:10:10] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-09 20:10:10] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-09 20:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-09 20:10:10] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:10:10] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-09 20:10:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-09 20:10:11] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2023-03-09 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 20:10:11] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-09 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 20:10:12] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-09 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 20:10:12] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2023-03-09 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 20:10:12] [INFO ] After 8014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 1686 ms.
[2023-03-09 20:10:14] [INFO ] After 10783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623406 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623406 steps, saw 311776 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:10:17] [INFO ] Invariant cache hit.
[2023-03-09 20:10:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:10:17] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:10:17] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:10:17] [INFO ] After 60ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:17] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:10:17] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:10:18] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:18] [INFO ] After 108ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:18] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:18] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 55 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598464 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598464 steps, saw 299292 distinct states, run finished after 3004 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 20:10:21] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 20:10:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:10:21] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:10:21] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:21] [INFO ] After 65ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:21] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:10:21] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:10:21] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:21] [INFO ] After 47ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:21] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:21] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 16 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 20:10:21] [INFO ] Invariant cache hit.
[2023-03-09 20:10:22] [INFO ] Implicit Places using invariants in 433 ms returned [25, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 449 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 24 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:10:22] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 20:10:22] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-09 20:10:22] [INFO ] Invariant cache hit.
[2023-03-09 20:10:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:25] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3088 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629526 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629526 steps, saw 314839 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:10:28] [INFO ] Invariant cache hit.
[2023-03-09 20:10:28] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:10:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:10:28] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:28] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:28] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:10:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:10:28] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:28] [INFO ] After 33ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:28] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:10:28] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:10:28] [INFO ] Invariant cache hit.
[2023-03-09 20:10:28] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 20:10:28] [INFO ] Invariant cache hit.
[2023-03-09 20:10:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:30] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
[2023-03-09 20:10:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:10:30] [INFO ] Invariant cache hit.
[2023-03-09 20:10:31] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2512 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
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 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 30 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 20:10:31] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 20:10:31] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:10:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:10:31] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:10:31] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:31] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:10:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:10:31] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:31] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:31] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2023-03-09 20:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 20:10:31] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:10:31] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622521 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622521 steps, saw 311332 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:10:34] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:10:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:10:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:10:34] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:10:34] [INFO ] After 28ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:34] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:10:35] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:10:35] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:35] [INFO ] After 29ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:35] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:10:35] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 26 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1473 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642876 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642876 steps, saw 321506 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:10:38] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 20:10:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:10:38] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 20:10:38] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:38] [INFO ] After 34ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:38] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:10:38] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 20:10:38] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:38] [INFO ] After 123ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:39] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:10:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 20:10:39] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:39] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 9 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:10:39] [INFO ] Invariant cache hit.
[2023-03-09 20:10:39] [INFO ] Implicit Places using invariants in 391 ms returned [25, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 395 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 18 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:10:39] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:10:39] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-09 20:10:39] [INFO ] Invariant cache hit.
[2023-03-09 20:10:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:41] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2364 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 640424 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640424 steps, saw 320288 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:10:44] [INFO ] Invariant cache hit.
[2023-03-09 20:10:44] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:10:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:10:44] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:45] [INFO ] After 260ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:45] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 20:10:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:10:45] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:45] [INFO ] After 175ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:45] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 20:10:45] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:45] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:10:45] [INFO ] Invariant cache hit.
[2023-03-09 20:10:45] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-09 20:10:45] [INFO ] Invariant cache hit.
[2023-03-09 20:10:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:47] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-09 20:10:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:10:47] [INFO ] Invariant cache hit.
[2023-03-09 20:10:48] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2443 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
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 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 18 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 20:10:48] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:10:48] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-09 20:10:48] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 20:10:48] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:10:48] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:10:48] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 20:10:48] [INFO ] After 204ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:48] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 20:10:48] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 20:10:48] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:48] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:48] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2023-03-09 20:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 20:10:48] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:10:48] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626124 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626124 steps, saw 313133 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:10:51] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 20:10:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 20:10:51] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:10:52] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:10:52] [INFO ] After 31ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:10:52] [INFO ] After 54ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:52] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 18 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649206 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649206 steps, saw 324677 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:10:55] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 20:10:55] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-09 20:10:55] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:10:55] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:10:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:55] [INFO ] After 153ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:55] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:10:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-09 20:10:55] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 20:10:55] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:56] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:10:56] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:10:56] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:10:56] [INFO ] Invariant cache hit.
[2023-03-09 20:10:56] [INFO ] Implicit Places using invariants in 393 ms returned [25, 45, 73, 78, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 395 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 16 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 20:10:56] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 20:10:56] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-09 20:10:56] [INFO ] Invariant cache hit.
[2023-03-09 20:10:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:10:59] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3026 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 494364 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494364 steps, saw 247231 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:11:02] [INFO ] Invariant cache hit.
[2023-03-09 20:11:02] [INFO ] [Real]Absence check using 14 positive place invariants in 34 ms returned sat
[2023-03-09 20:11:02] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:11:02] [INFO ] After 215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:02] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:02] [INFO ] After 127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:11:02] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:11:02] [INFO ] Invariant cache hit.
[2023-03-09 20:11:03] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-09 20:11:03] [INFO ] Invariant cache hit.
[2023-03-09 20:11:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:05] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
[2023-03-09 20:11:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:11:05] [INFO ] Invariant cache hit.
[2023-03-09 20:11:05] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3083 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 27 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 20:11:05] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 20:11:05] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-09 20:11:05] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 20:11:06] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:11:06] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:06] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 20:11:06] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589449 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589449 steps, saw 294786 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:11:09] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:11:09] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:11:09] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:11:09] [INFO ] After 50ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:09] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 20:11:09] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 22 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642423 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642423 steps, saw 321284 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:11:12] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 20:11:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:11:12] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 37 ms returned sat
[2023-03-09 20:11:12] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:13] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:13] [INFO ] After 426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:11:13] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 35 ms returned sat
[2023-03-09 20:11:13] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:13] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:13] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:11:13] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:11:13] [INFO ] Invariant cache hit.
[2023-03-09 20:11:14] [INFO ] Implicit Places using invariants in 623 ms returned [25, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 631 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 19 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 20:11:14] [INFO ] Computed 32 place invariants in 15 ms
[2023-03-09 20:11:14] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-09 20:11:14] [INFO ] Invariant cache hit.
[2023-03-09 20:11:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:17] [INFO ] Implicit Places using invariants and state equation in 2715 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3730 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 583642 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583642 steps, saw 291888 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:11:20] [INFO ] Invariant cache hit.
[2023-03-09 20:11:20] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2023-03-09 20:11:20] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:11:20] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:21] [INFO ] After 479ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:21] [INFO ] After 512ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:11:21] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:11:21] [INFO ] Invariant cache hit.
[2023-03-09 20:11:21] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 20:11:21] [INFO ] Invariant cache hit.
[2023-03-09 20:11:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:24] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
[2023-03-09 20:11:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:11:24] [INFO ] Invariant cache hit.
[2023-03-09 20:11:24] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3391 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
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 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 23 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 20:11:24] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 20:11:24] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 20:11:24] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:11:24] [INFO ] After 244ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:11:24] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:25] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:11:25] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1466 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597112 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 597112 steps, saw 298619 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:11:28] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 20:11:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:11:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 20:11:28] [INFO ] After 307ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:11:28] [INFO ] After 53ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:28] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:11:28] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 20:11:28] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:29] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:29] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:11:29] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 25 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 616131 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 616131 steps, saw 308142 distinct states, run finished after 3002 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:11:32] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:11:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:11:32] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 50 ms returned sat
[2023-03-09 20:11:32] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:32] [INFO ] After 314ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:32] [INFO ] After 344ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:11:32] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:11:32] [INFO ] Invariant cache hit.
[2023-03-09 20:11:33] [INFO ] Implicit Places using invariants in 517 ms returned [25, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 519 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 216
Applied a total of 12 rules in 13 ms. Remains 212 /218 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 212 cols
[2023-03-09 20:11:33] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 20:11:33] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 20:11:33] [INFO ] Invariant cache hit.
[2023-03-09 20:11:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:36] [INFO ] Implicit Places using invariants and state equation in 3083 ms returned []
Implicit Place search using SMT with State Equation took 3502 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4042 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1485 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 594374 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 594374 steps, saw 297250 distinct states, run finished after 3003 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:11:39] [INFO ] Invariant cache hit.
[2023-03-09 20:11:40] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-09 20:11:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 20:11:40] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:40] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:40] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-09 20:11:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-09 20:11:40] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:40] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:40] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:11:40] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:11:40] [INFO ] Invariant cache hit.
[2023-03-09 20:11:41] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 20:11:41] [INFO ] Invariant cache hit.
[2023-03-09 20:11:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:44] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 3456 ms to find 0 implicit places.
[2023-03-09 20:11:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:11:44] [INFO ] Invariant cache hit.
[2023-03-09 20:11:44] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3735 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
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 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 17 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 20:11:44] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 20:11:44] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-09 20:11:44] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-09 20:11:44] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:11:44] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:44] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-09 20:11:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-09 20:11:44] [INFO ] After 197ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:44] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-09 20:11:45] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 20:11:45] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:45] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:45] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-09 20:11:45] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:11:45] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 17 ms. (steps per millisecond=119 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 18 ms. (steps per millisecond=112 ) properties seen :1
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 586567 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 586567 steps, saw 293344 distinct states, run finished after 3005 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:11:48] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:11:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:11:48] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 20:11:49] [INFO ] After 280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:11:49] [INFO ] After 47ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:49] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:11:49] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:11:49] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:49] [INFO ] After 44ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-03-09 20:11:49] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 20:11:49] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 24 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 590534 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590534 steps, saw 295331 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:11:52] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-09 20:11:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:11:53] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-09 20:11:53] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:11:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:53] [INFO ] After 76ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:11:53] [INFO ] After 122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:53] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:11:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:11:53] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 20:11:53] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:53] [INFO ] After 93ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:11:53] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:11:53] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:11:53] [INFO ] Invariant cache hit.
[2023-03-09 20:11:54] [INFO ] Implicit Places using invariants in 626 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 627 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:11:54] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:11:55] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-09 20:11:55] [INFO ] Invariant cache hit.
[2023-03-09 20:11:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:11:57] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3593 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609404 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609404 steps, saw 304763 distinct states, run finished after 3002 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:12:00] [INFO ] Invariant cache hit.
[2023-03-09 20:12:00] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-09 20:12:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:12:00] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:01] [INFO ] After 179ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:01] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 20:12:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:12:01] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:01] [INFO ] After 151ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:01] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:12:01] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:12:01] [INFO ] Invariant cache hit.
[2023-03-09 20:12:01] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-09 20:12:01] [INFO ] Invariant cache hit.
[2023-03-09 20:12:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:04] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3009 ms to find 0 implicit places.
[2023-03-09 20:12:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:12:04] [INFO ] Invariant cache hit.
[2023-03-09 20:12:04] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3332 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 23 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:12:04] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 20:12:05] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:12:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:12:05] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:12:05] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:05] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:05] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:12:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:12:05] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:05] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:05] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:12:05] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597469 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597469 steps, saw 298800 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:12:08] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:12:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:12:08] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:12:08] [INFO ] After 214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:12:08] [INFO ] After 57ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:08] [INFO ] After 87ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:12:08] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 16 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648040 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 648040 steps, saw 324089 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:12:12] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:12:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:12:12] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 20:12:12] [INFO ] After 198ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:12] [INFO ] After 42ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:12] [INFO ] After 76ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:12:12] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:12:12] [INFO ] Invariant cache hit.
[2023-03-09 20:12:13] [INFO ] Implicit Places using invariants in 575 ms returned [25, 45, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 577 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 19 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 20:12:13] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 20:12:13] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-09 20:12:13] [INFO ] Invariant cache hit.
[2023-03-09 20:12:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:16] [INFO ] Implicit Places using invariants and state equation in 3255 ms returned []
Implicit Place search using SMT with State Equation took 3626 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4230 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647770 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647770 steps, saw 323958 distinct states, run finished after 3006 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:12:19] [INFO ] Invariant cache hit.
[2023-03-09 20:12:19] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 20:12:19] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:12:19] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:20] [INFO ] After 306ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:20] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-09 20:12:20] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-09 20:12:20] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:20] [INFO ] After 257ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:20] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:12:20] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:12:21] [INFO ] Invariant cache hit.
[2023-03-09 20:12:21] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-09 20:12:21] [INFO ] Invariant cache hit.
[2023-03-09 20:12:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:25] [INFO ] Implicit Places using invariants and state equation in 4166 ms returned []
Implicit Place search using SMT with State Equation took 4562 ms to find 0 implicit places.
[2023-03-09 20:12:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:12:25] [INFO ] Invariant cache hit.
[2023-03-09 20:12:25] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4857 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
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 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 21 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 20:12:25] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 20:12:25] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 20:12:25] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:12:26] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:12:26] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:26] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:12:26] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511646 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511646 steps, saw 255874 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:12:29] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:12:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:12:29] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 20:12:29] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:12:29] [INFO ] After 54ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:29] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:12:29] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 17 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 656989 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656989 steps, saw 328566 distinct states, run finished after 3007 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:12:32] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 20:12:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:12:32] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-09 20:12:33] [INFO ] After 256ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:33] [INFO ] After 103ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:33] [INFO ] After 136ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:12:33] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:12:33] [INFO ] Invariant cache hit.
[2023-03-09 20:12:34] [INFO ] Implicit Places using invariants in 599 ms returned [47, 52, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 606 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Applied a total of 12 rules in 12 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 20:12:34] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 20:12:34] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 20:12:34] [INFO ] Invariant cache hit.
[2023-03-09 20:12:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:36] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3064 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659692 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659692 steps, saw 329918 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:12:39] [INFO ] Invariant cache hit.
[2023-03-09 20:12:39] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 20:12:39] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:12:39] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:39] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:39] [INFO ] After 105ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:12:39] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:12:39] [INFO ] Invariant cache hit.
[2023-03-09 20:12:40] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 20:12:40] [INFO ] Invariant cache hit.
[2023-03-09 20:12:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:41] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2023-03-09 20:12:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:12:41] [INFO ] Invariant cache hit.
[2023-03-09 20:12:42] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2275 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 11 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 20:12:42] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 20:12:42] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 20:12:42] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:12:42] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:12:42] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:12:42] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:12:42] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636976 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636976 steps, saw 318560 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:12:45] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:12:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:12:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:12:45] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:12:45] [INFO ] After 63ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:45] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:12:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:12:45] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:46] [INFO ] After 69ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:46] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:12:46] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 83 place count 227 transition count 220
Applied a total of 83 rules in 15 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657913 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657913 steps, saw 329028 distinct states, run finished after 3006 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:12:49] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 20:12:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:12:49] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 20:12:49] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:49] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:49] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:12:49] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 20:12:49] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:49] [INFO ] After 197ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:49] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:12:49] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:12:49] [INFO ] Invariant cache hit.
[2023-03-09 20:12:50] [INFO ] Implicit Places using invariants in 385 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 387 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 11 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:12:50] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 20:12:50] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 20:12:50] [INFO ] Invariant cache hit.
[2023-03-09 20:12:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:52] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2417 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649315 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649315 steps, saw 324732 distinct states, run finished after 3004 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:12:55] [INFO ] Invariant cache hit.
[2023-03-09 20:12:55] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:12:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:12:55] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:55] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:55] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:12:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:12:55] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:56] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:56] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:12:56] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:12:56] [INFO ] Invariant cache hit.
[2023-03-09 20:12:56] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-09 20:12:56] [INFO ] Invariant cache hit.
[2023-03-09 20:12:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:12:58] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-09 20:12:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:12:58] [INFO ] Invariant cache hit.
[2023-03-09 20:12:58] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2263 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 13 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 20:12:58] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 20:12:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 20:12:58] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-09 20:12:58] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:12:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:12:58] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:58] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:12:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 20:12:58] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-09 20:12:58] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:58] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:12:58] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:12:58] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 628159 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 628159 steps, saw 314152 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:13:01] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:13:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:01] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:13:02] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:02] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:13:02] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:13:02] [INFO ] After 47ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:02] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:13:02] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 14 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625883 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625883 steps, saw 313013 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:13:05] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:13:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:13:05] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 20:13:05] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:13:05] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:13:06] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:06] [INFO ] After 146ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:06] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-09 20:13:06] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-09 20:13:06] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-09 20:13:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-09 20:13:06] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 20:13:06] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:13:06] [INFO ] Invariant cache hit.
[2023-03-09 20:13:07] [INFO ] Implicit Places using invariants in 630 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 633 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:13:07] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:13:07] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 20:13:07] [INFO ] Invariant cache hit.
[2023-03-09 20:13:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:09] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2628 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 694580 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694580 steps, saw 347364 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:13:12] [INFO ] Invariant cache hit.
[2023-03-09 20:13:12] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:13:12] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:13:12] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:13:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:13:12] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:12] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-09 20:13:12] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-09 20:13:13] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-09 20:13:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 296 ms
[2023-03-09 20:13:13] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:13:13] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:13:13] [INFO ] Invariant cache hit.
[2023-03-09 20:13:13] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 20:13:13] [INFO ] Invariant cache hit.
[2023-03-09 20:13:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:16] [INFO ] Implicit Places using invariants and state equation in 2698 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
[2023-03-09 20:13:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:13:16] [INFO ] Invariant cache hit.
[2023-03-09 20:13:16] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3280 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 21 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:13:16] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 20:13:16] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:13:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:13:16] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:13:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:13:17] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:13:17] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:17] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-09 20:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 20:13:17] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:13:17] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 580536 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 580536 steps, saw 290331 distinct states, run finished after 3006 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:13:20] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 20:13:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:13:20] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:13:20] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:20] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:13:20] [INFO ] After 69ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:13:20] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:13:20] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 13 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1487 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621167 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 621167 steps, saw 310654 distinct states, run finished after 3002 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:13:23] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 20:13:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:23] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 20:13:23] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:23] [INFO ] After 52ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:23] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:24] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 20:13:24] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:24] [INFO ] After 42ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:24] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:13:24] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:13:24] [INFO ] Invariant cache hit.
[2023-03-09 20:13:25] [INFO ] Implicit Places using invariants in 743 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 745 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 214 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 213
Applied a total of 14 rules in 11 ms. Remains 207 /214 variables (removed 7) and now considering 213/220 (removed 7) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 20:13:25] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:13:25] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-09 20:13:25] [INFO ] Invariant cache hit.
[2023-03-09 20:13:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:28] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3297 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/227 places, 213/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4060 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602669 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602669 steps, saw 301400 distinct states, run finished after 3004 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:13:31] [INFO ] Invariant cache hit.
[2023-03-09 20:13:31] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:13:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-09 20:13:31] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:31] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:31] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 20:13:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:13:31] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:31] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:31] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:13:32] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:13:32] [INFO ] Invariant cache hit.
[2023-03-09 20:13:32] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-09 20:13:32] [INFO ] Invariant cache hit.
[2023-03-09 20:13:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:35] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 3343 ms to find 0 implicit places.
[2023-03-09 20:13:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:13:35] [INFO ] Invariant cache hit.
[2023-03-09 20:13:35] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3681 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 23 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:13:35] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 20:13:35] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 20:13:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:13:35] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:13:36] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:36] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:13:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:13:36] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:36] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:36] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2023-03-09 20:13:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 20:13:36] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:13:36] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1478 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596188 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596188 steps, saw 298158 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:13:39] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-09 20:13:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:39] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:13:39] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:13:39] [INFO ] After 108ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:13:39] [INFO ] After 133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 20:13:39] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 14 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619324 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619324 steps, saw 309733 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:13:43] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 20:13:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:13:43] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 20:13:43] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:43] [INFO ] After 90ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:13:43] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:13:43] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:13:43] [INFO ] Invariant cache hit.
[2023-03-09 20:13:44] [INFO ] Implicit Places using invariants in 634 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 645 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:13:44] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:13:44] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-09 20:13:44] [INFO ] Invariant cache hit.
[2023-03-09 20:13:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:46] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3409 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648942 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648942 steps, saw 324543 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:13:49] [INFO ] Invariant cache hit.
[2023-03-09 20:13:49] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-09 20:13:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:13:50] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:50] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:13:50] [INFO ] After 100ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:13:50] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 13 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:13:50] [INFO ] Invariant cache hit.
[2023-03-09 20:13:50] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-09 20:13:50] [INFO ] Invariant cache hit.
[2023-03-09 20:13:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:13:53] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-09 20:13:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:13:53] [INFO ] Invariant cache hit.
[2023-03-09 20:13:53] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3188 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 21 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:13:53] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 20:13:53] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:13:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:13:53] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:13:53] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:53] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 20:13:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:13:54] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:54] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:54] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-09 20:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-09 20:13:54] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:13:54] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1480 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618597 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618597 steps, saw 309370 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:13:57] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 20:13:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:13:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:13:57] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:13:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:13:57] [INFO ] After 42ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:57] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:13:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:13:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:13:57] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:58] [INFO ] After 91ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:13:58] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-09 20:13:58] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-09 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-09 20:13:58] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:13:58] [INFO ] After 928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 22 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619675 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619675 steps, saw 309908 distinct states, run finished after 3004 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:14:01] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 20:14:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:01] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 20:14:01] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:01] [INFO ] After 109ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:01] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:02] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-09 20:14:02] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:02] [INFO ] After 155ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:02] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-09 20:14:02] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2023-03-09 20:14:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-03-09 20:14:02] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:14:02] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:14:02] [INFO ] Invariant cache hit.
[2023-03-09 20:14:03] [INFO ] Implicit Places using invariants in 723 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 725 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:14:03] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:14:03] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-09 20:14:03] [INFO ] Invariant cache hit.
[2023-03-09 20:14:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:06] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3782 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621785 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621785 steps, saw 310966 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:14:09] [INFO ] Invariant cache hit.
[2023-03-09 20:14:09] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 20:14:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:14:09] [INFO ] After 226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:10] [INFO ] After 105ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:10] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 20:14:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:14:10] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:10] [INFO ] After 190ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:10] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-09 20:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 20:14:10] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:14:10] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:14:10] [INFO ] Invariant cache hit.
[2023-03-09 20:14:11] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 20:14:11] [INFO ] Invariant cache hit.
[2023-03-09 20:14:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:13] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2023-03-09 20:14:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:14:13] [INFO ] Invariant cache hit.
[2023-03-09 20:14:13] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2671 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
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 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:14:13] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 20:14:13] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:14:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:14:13] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:14:13] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:14:13] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-09 20:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 20:14:13] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:13] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 20:14:14] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:14:14] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:14] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:14] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:14:14] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 557879 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557879 steps, saw 279001 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:14:17] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:14:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:14:17] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:14:17] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:14:17] [INFO ] After 83ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:17] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:14:17] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:14:18] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:18] [INFO ] After 61ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:18] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:14:18] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 16 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602448 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602448 steps, saw 301284 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 20:14:21] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:14:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:21] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 41 ms returned sat
[2023-03-09 20:14:21] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:21] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:21] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:14:21] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 38 ms returned sat
[2023-03-09 20:14:21] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:21] [INFO ] After 94ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:21] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:14:22] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 20:14:22] [INFO ] Invariant cache hit.
[2023-03-09 20:14:22] [INFO ] Implicit Places using invariants in 708 ms returned [25, 45, 50, 72, 77, 98, 104, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 712 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 13 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:14:22] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:14:23] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-09 20:14:23] [INFO ] Invariant cache hit.
[2023-03-09 20:14:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:25] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3791 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 603323 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603323 steps, saw 301727 distinct states, run finished after 3004 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:14:28] [INFO ] Invariant cache hit.
[2023-03-09 20:14:28] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 20:14:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:14:29] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:29] [INFO ] After 97ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:29] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-09 20:14:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:14:29] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:29] [INFO ] After 96ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:29] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:14:29] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:14:29] [INFO ] Invariant cache hit.
[2023-03-09 20:14:30] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-09 20:14:30] [INFO ] Invariant cache hit.
[2023-03-09 20:14:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:32] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
[2023-03-09 20:14:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:14:32] [INFO ] Invariant cache hit.
[2023-03-09 20:14:32] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3027 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 20 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 20:14:32] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 20:14:32] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:14:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:14:33] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:14:33] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:33] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:14:33] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:14:33] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:33] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 0 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 3 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 3 ms to minimize.
[2023-03-09 20:14:34] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-09 20:14:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 747 ms
[2023-03-09 20:14:34] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:14:34] [INFO ] After 1058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614239 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614239 steps, saw 307195 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:14:37] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:37] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:14:37] [INFO ] After 209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:14:37] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:37] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:14:37] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:14:37] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:37] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:38] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-09 20:14:38] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-09 20:14:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-09 20:14:38] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:14:38] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 25 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593374 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593374 steps, saw 296748 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:14:41] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 20:14:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:14:41] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 20:14:41] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:41] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:41] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:41] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 38 ms returned sat
[2023-03-09 20:14:42] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:42] [INFO ] After 220ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:42] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-09 20:14:42] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:14:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-03-09 20:14:42] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:14:42] [INFO ] After 1028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:14:42] [INFO ] Invariant cache hit.
[2023-03-09 20:14:43] [INFO ] Implicit Places using invariants in 714 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 715 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 16 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:14:43] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:14:43] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-09 20:14:43] [INFO ] Invariant cache hit.
[2023-03-09 20:14:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:46] [INFO ] Implicit Places using invariants and state equation in 2944 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4109 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 610997 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610997 steps, saw 305562 distinct states, run finished after 3003 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:14:49] [INFO ] Invariant cache hit.
[2023-03-09 20:14:49] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-09 20:14:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:14:50] [INFO ] After 246ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:50] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:50] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2023-03-09 20:14:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-09 20:14:50] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:50] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:50] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-09 20:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 20:14:50] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:14:50] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:14:50] [INFO ] Invariant cache hit.
[2023-03-09 20:14:51] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 20:14:51] [INFO ] Invariant cache hit.
[2023-03-09 20:14:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:14:53] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2023-03-09 20:14:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:14:53] [INFO ] Invariant cache hit.
[2023-03-09 20:14:53] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2673 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
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 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 13 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 20:14:53] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 20:14:53] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:14:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:14:53] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:14:53] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:14:54] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2023-03-09 20:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 20:14:54] [INFO ] After 148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:54] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:14:54] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:14:54] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:54] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:54] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:14:54] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519219 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 519219 steps, saw 259662 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:14:57] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 20:14:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 20:14:57] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:14:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:14:57] [INFO ] After 106ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:57] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:14:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:14:58] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 20:14:58] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:58] [INFO ] After 74ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:14:58] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:14:58] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617401 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617401 steps, saw 308774 distinct states, run finished after 3004 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:15:01] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:15:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-09 20:15:01] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 31 ms returned sat
[2023-03-09 20:15:01] [INFO ] After 244ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:01] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:15:01] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:15:02] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:15:02] [INFO ] Invariant cache hit.
[2023-03-09 20:15:02] [INFO ] Implicit Places using invariants in 570 ms returned [25, 45, 50, 71, 98, 104, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 571 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 16 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 20:15:02] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 20:15:03] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-09 20:15:03] [INFO ] Invariant cache hit.
[2023-03-09 20:15:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:05] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2652 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3245 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 672193 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 672193 steps, saw 336169 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:15:08] [INFO ] Invariant cache hit.
[2023-03-09 20:15:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:15:08] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 29 ms returned sat
[2023-03-09 20:15:08] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:08] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:08] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:15:08] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 30 ms returned sat
[2023-03-09 20:15:08] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:09] [INFO ] After 74ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:09] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:15:09] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:15:09] [INFO ] Invariant cache hit.
[2023-03-09 20:15:09] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-09 20:15:09] [INFO ] Invariant cache hit.
[2023-03-09 20:15:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:11] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2023-03-09 20:15:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:15:11] [INFO ] Invariant cache hit.
[2023-03-09 20:15:12] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2932 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
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 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 17 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 20:15:12] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 20:15:12] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-09 20:15:12] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:15:12] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:15:12] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:15:12] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:15:12] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602014 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602014 steps, saw 301069 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:15:15] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:15:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:15:15] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:15:15] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:15:15] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 20:15:16] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:15:16] [INFO ] After 74ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:16] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:15:16] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1470 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609218 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609218 steps, saw 304672 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:15:19] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 20:15:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:15:19] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-09 20:15:19] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:19] [INFO ] After 93ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:19] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:15:19] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 37 ms returned sat
[2023-03-09 20:15:20] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:20] [INFO ] After 74ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:20] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:15:20] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:15:20] [INFO ] Invariant cache hit.
[2023-03-09 20:15:21] [INFO ] Implicit Places using invariants in 728 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 730 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:15:21] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:15:21] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-09 20:15:21] [INFO ] Invariant cache hit.
[2023-03-09 20:15:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:23] [INFO ] Implicit Places using invariants and state equation in 2474 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3682 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613348 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613348 steps, saw 306738 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:15:27] [INFO ] Invariant cache hit.
[2023-03-09 20:15:27] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 20:15:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:15:27] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 20:15:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:15:27] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:27] [INFO ] After 77ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:27] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2023-03-09 20:15:28] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-09 20:15:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-09 20:15:28] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-09 20:15:28] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:15:28] [INFO ] Invariant cache hit.
[2023-03-09 20:15:28] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-09 20:15:28] [INFO ] Invariant cache hit.
[2023-03-09 20:15:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:30] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2023-03-09 20:15:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:15:30] [INFO ] Invariant cache hit.
[2023-03-09 20:15:30] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2436 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 27 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:15:30] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 20:15:30] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:15:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:15:30] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 20:15:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:15:31] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:15:31] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:31] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:15:31] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 611173 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 611173 steps, saw 305654 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:15:34] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:15:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:15:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-09 20:15:34] [INFO ] After 213ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:15:34] [INFO ] After 53ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:34] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:15:34] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:15:34] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:35] [INFO ] After 264ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:35] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2023-03-09 20:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-09 20:15:35] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:15:35] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 22 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536887 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536887 steps, saw 268506 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:15:38] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:15:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:15:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:15:38] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:38] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:38] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:15:38] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 27 ms returned sat
[2023-03-09 20:15:39] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:39] [INFO ] After 166ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:39] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:15:39] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 0 ms to minimize.
[2023-03-09 20:15:39] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 1 ms to minimize.
[2023-03-09 20:15:40] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 1 ms to minimize.
[2023-03-09 20:15:40] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:15:40] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-09 20:15:40] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 1 ms to minimize.
[2023-03-09 20:15:40] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:15:41] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-09 20:15:41] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-09 20:15:42] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:15:42] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 1 ms to minimize.
[2023-03-09 20:15:42] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 1 ms to minimize.
[2023-03-09 20:15:42] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 0 ms to minimize.
[2023-03-09 20:15:43] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 1 ms to minimize.
[2023-03-09 20:15:43] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 14 ms to minimize.
[2023-03-09 20:15:43] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:15:44] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:15:44] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:15:44] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:15:45] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:15:45] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:15:45] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:15:45] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:15:46] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7439 ms
[2023-03-09 20:15:46] [INFO ] After 7644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 20:15:46] [INFO ] After 7954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:15:46] [INFO ] Invariant cache hit.
[2023-03-09 20:15:47] [INFO ] Implicit Places using invariants in 568 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 580 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 18 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:15:47] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:15:47] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-09 20:15:47] [INFO ] Invariant cache hit.
[2023-03-09 20:15:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:49] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2938 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 604035 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604035 steps, saw 302079 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:15:52] [INFO ] Invariant cache hit.
[2023-03-09 20:15:52] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:15:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:15:53] [INFO ] After 207ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:53] [INFO ] After 76ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:53] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:15:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:15:53] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:53] [INFO ] After 124ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:53] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 0 ms to minimize.
[2023-03-09 20:15:53] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 0 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 0 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-09 20:15:54] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-09 20:15:55] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 0 ms to minimize.
[2023-03-09 20:15:55] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2023-03-09 20:15:55] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 1 ms to minimize.
[2023-03-09 20:15:55] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 1 ms to minimize.
[2023-03-09 20:15:55] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 0 ms to minimize.
[2023-03-09 20:15:56] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 1 ms to minimize.
[2023-03-09 20:15:56] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:15:56] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:15:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2934 ms
[2023-03-09 20:15:56] [INFO ] After 3109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 20:15:56] [INFO ] After 3411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:15:56] [INFO ] Invariant cache hit.
[2023-03-09 20:15:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-09 20:15:56] [INFO ] Invariant cache hit.
[2023-03-09 20:15:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:15:59] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2023-03-09 20:15:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:15:59] [INFO ] Invariant cache hit.
[2023-03-09 20:15:59] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2799 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 19 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:15:59] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:15:59] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:15:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:15:59] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:15:59] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:59] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:15:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:15:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:15:59] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:59] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:15:59] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 20:15:59] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:15:59] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636958 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636958 steps, saw 318553 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:16:02] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:16:03] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:16:03] [INFO ] After 41ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:03] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:16:03] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 12 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 656007 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656007 steps, saw 328076 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:16:06] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:16:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:06] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 20:16:06] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:06] [INFO ] After 165ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:06] [INFO ] After 187ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:16:06] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:16:06] [INFO ] Invariant cache hit.
[2023-03-09 20:16:07] [INFO ] Implicit Places using invariants in 405 ms returned [25, 45, 50, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 418 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 27 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 20:16:07] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 20:16:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-09 20:16:07] [INFO ] Invariant cache hit.
[2023-03-09 20:16:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:09] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2735 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1476 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661312 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661312 steps, saw 330730 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:16:12] [INFO ] Invariant cache hit.
[2023-03-09 20:16:12] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-09 20:16:12] [INFO ] [Real]Absence check using 6 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 20:16:12] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:12] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:12] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-09 20:16:12] [INFO ] [Nat]Absence check using 6 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 20:16:13] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:13] [INFO ] After 73ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:13] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:16:13] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:16:13] [INFO ] Invariant cache hit.
[2023-03-09 20:16:13] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 20:16:13] [INFO ] Invariant cache hit.
[2023-03-09 20:16:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:15] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
[2023-03-09 20:16:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:16:15] [INFO ] Invariant cache hit.
[2023-03-09 20:16:15] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2661 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
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 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 13 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 20:16:15] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 20:16:15] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 20:16:15] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:16:16] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:16:16] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:16] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:16:16] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 638854 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638854 steps, saw 319498 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:16:19] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:16:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:16:19] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:16:19] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:16:19] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:19] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:16:19] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 14 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661865 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661865 steps, saw 331005 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:16:22] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:16:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:16:22] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 20:16:22] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:22] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:22] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:16:22] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 20:16:23] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:23] [INFO ] After 120ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:23] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:16:23] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:16:23] [INFO ] Invariant cache hit.
[2023-03-09 20:16:23] [INFO ] Implicit Places using invariants in 308 ms returned [25, 45, 50, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 328 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 216
Applied a total of 12 rules in 7 ms. Remains 212 /218 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 212 cols
[2023-03-09 20:16:23] [INFO ] Computed 33 place invariants in 11 ms
[2023-03-09 20:16:23] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-09 20:16:23] [INFO ] Invariant cache hit.
[2023-03-09 20:16:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:25] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2524 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 669458 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 669458 steps, saw 334804 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:16:28] [INFO ] Invariant cache hit.
[2023-03-09 20:16:28] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 20:16:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-09 20:16:29] [INFO ] After 265ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:29] [INFO ] After 56ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:29] [INFO ] After 77ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:16:29] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:16:29] [INFO ] Invariant cache hit.
[2023-03-09 20:16:29] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-09 20:16:29] [INFO ] Invariant cache hit.
[2023-03-09 20:16:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:31] [INFO ] Implicit Places using invariants and state equation in 1912 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2023-03-09 20:16:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:16:31] [INFO ] Invariant cache hit.
[2023-03-09 20:16:31] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2387 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 11 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 20:16:31] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-09 20:16:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-09 20:16:31] [INFO ] [Real]Absence check using 6 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-09 20:16:31] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:16:31] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:31] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:16:31] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639947 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639947 steps, saw 320047 distinct states, run finished after 3004 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:16:34] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:16:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:35] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:16:35] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:16:35] [INFO ] After 95ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:35] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:35] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:16:35] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:35] [INFO ] After 74ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:35] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-09 20:16:35] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 14 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657722 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657722 steps, saw 328935 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:16:38] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:16:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:16:39] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:39] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:39] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:16:39] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 20:16:39] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:39] [INFO ] After 84ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:39] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:16:39] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:16:39] [INFO ] Invariant cache hit.
[2023-03-09 20:16:39] [INFO ] Implicit Places using invariants in 502 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 515 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 10 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:16:40] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 20:16:40] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 20:16:40] [INFO ] Invariant cache hit.
[2023-03-09 20:16:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:42] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3143 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662717 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662717 steps, saw 331433 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:16:45] [INFO ] Invariant cache hit.
[2023-03-09 20:16:45] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:16:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:16:45] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:45] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:45] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:16:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:16:46] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:46] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:46] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:16:46] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:16:46] [INFO ] Invariant cache hit.
[2023-03-09 20:16:46] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-09 20:16:46] [INFO ] Invariant cache hit.
[2023-03-09 20:16:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:48] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 2489 ms to find 0 implicit places.
[2023-03-09 20:16:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:16:48] [INFO ] Invariant cache hit.
[2023-03-09 20:16:48] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2696 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
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 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:16:48] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 20:16:49] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:16:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:16:49] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:16:49] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:49] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-03-09 20:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 20:16:49] [INFO ] After 133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:49] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:16:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:16:49] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:49] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:49] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-09 20:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 20:16:49] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:16:49] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 671581 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671581 steps, saw 335862 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:16:52] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:16:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:52] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:16:52] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:16:52] [INFO ] After 51ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:16:52] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:16:52] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 14 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697692 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697692 steps, saw 348915 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:16:56] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:16:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 20:16:56] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:16:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:56] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:56] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:16:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:16:56] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 20:16:56] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:56] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:16:56] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:16:56] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:16:56] [INFO ] Invariant cache hit.
[2023-03-09 20:16:56] [INFO ] Implicit Places using invariants in 345 ms returned [25, 45, 50, 71, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 346 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 10 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 20:16:57] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 20:16:57] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-09 20:16:57] [INFO ] Invariant cache hit.
[2023-03-09 20:16:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:16:59] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2614 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1469 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665610 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665610 steps, saw 332878 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:17:02] [INFO ] Invariant cache hit.
[2023-03-09 20:17:02] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 20:17:02] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:17:02] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:02] [INFO ] After 99ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:02] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:17:02] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:17:02] [INFO ] Invariant cache hit.
[2023-03-09 20:17:02] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-09 20:17:02] [INFO ] Invariant cache hit.
[2023-03-09 20:17:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:04] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-03-09 20:17:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:17:04] [INFO ] Invariant cache hit.
[2023-03-09 20:17:04] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2142 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
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 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 20:17:04] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 20:17:04] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-09 20:17:04] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:05] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:17:05] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:05] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:17:05] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636037 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636037 steps, saw 318092 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:17:08] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:17:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:08] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 20:17:08] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:17:08] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:08] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:08] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:17:08] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:08] [INFO ] After 40ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:08] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 20:17:08] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660067 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 660067 steps, saw 330107 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:17:11] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 20:17:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:11] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 20:17:12] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:12] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:12] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:17:12] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-09 20:17:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2023-03-09 20:17:12] [INFO ] After 390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:12] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 20:17:12] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:12] [INFO ] After 49ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:12] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 0 ms to minimize.
[2023-03-09 20:17:13] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2023-03-09 20:17:13] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-09 20:17:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2023-03-09 20:17:13] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:17:13] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:17:13] [INFO ] Invariant cache hit.
[2023-03-09 20:17:13] [INFO ] Implicit Places using invariants in 472 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 473 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 213 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 207 transition count 213
Applied a total of 12 rules in 7 ms. Remains 207 /213 variables (removed 6) and now considering 213/219 (removed 6) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 20:17:13] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:17:14] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-09 20:17:14] [INFO ] Invariant cache hit.
[2023-03-09 20:17:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:15] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/226 places, 213/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2596 ms. Remains : 207/226 places, 213/219 transitions.
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645015 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 645015 steps, saw 322581 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:17:18] [INFO ] Invariant cache hit.
[2023-03-09 20:17:18] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:17:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:17:19] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:19] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:19] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-09 20:17:19] [INFO ] After 200ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:19] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 20:17:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:17:19] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:19] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:19] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-09 20:17:19] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-09 20:17:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-09 20:17:20] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:17:20] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:17:20] [INFO ] Invariant cache hit.
[2023-03-09 20:17:20] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 20:17:20] [INFO ] Invariant cache hit.
[2023-03-09 20:17:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:22] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2023-03-09 20:17:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:17:22] [INFO ] Invariant cache hit.
[2023-03-09 20:17:22] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2529 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 11 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:17:22] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:17:22] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:17:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:22] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:17:22] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:22] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:17:22] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 12 ms. (steps per millisecond=169 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 12 ms. (steps per millisecond=169 ) properties seen :1
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614929 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614929 steps, saw 307537 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:17:25] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 20:17:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:25] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:17:26] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:17:26] [INFO ] After 54ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:26] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:17:26] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 20:17:26] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 16 ms returned sat
[2023-03-09 20:17:26] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:26] [INFO ] After 43ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:26] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:17:26] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 640652 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640652 steps, saw 320396 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:17:29] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:17:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:29] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:17:29] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:29] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:29] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:30] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:17:30] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:30] [INFO ] After 129ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:30] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:17:30] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:17:30] [INFO ] Invariant cache hit.
[2023-03-09 20:17:30] [INFO ] Implicit Places using invariants in 500 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 501 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:17:30] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:17:31] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-09 20:17:31] [INFO ] Invariant cache hit.
[2023-03-09 20:17:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:33] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2689 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625594 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625594 steps, saw 312869 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:17:36] [INFO ] Invariant cache hit.
[2023-03-09 20:17:36] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:17:36] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:36] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:36] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:36] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:17:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:36] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:36] [INFO ] After 89ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:36] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:17:36] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:17:36] [INFO ] Invariant cache hit.
[2023-03-09 20:17:37] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-09 20:17:37] [INFO ] Invariant cache hit.
[2023-03-09 20:17:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:38] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2023-03-09 20:17:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:17:38] [INFO ] Invariant cache hit.
[2023-03-09 20:17:39] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2326 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
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 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:17:39] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:17:39] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:17:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:17:39] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:17:39] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:39] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 20:17:39] [INFO ] After 112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:39] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:17:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:39] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:39] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:39] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-09 20:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 20:17:39] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:17:39] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621596 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621596 steps, saw 310869 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:17:42] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:17:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:17:42] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:17:43] [INFO ] After 86ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:43] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:43] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:17:43] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:43] [INFO ] After 98ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:43] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:17:43] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643605 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643605 steps, saw 321873 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:17:46] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:17:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:46] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:17:46] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:46] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:46] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:46] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:17:47] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:47] [INFO ] After 71ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:47] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:17:47] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:17:47] [INFO ] Invariant cache hit.
[2023-03-09 20:17:47] [INFO ] Implicit Places using invariants in 466 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 468 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:17:47] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:17:47] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-09 20:17:47] [INFO ] Invariant cache hit.
[2023-03-09 20:17:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:49] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2140 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642130 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 642130 steps, saw 321137 distinct states, run finished after 3003 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:17:52] [INFO ] Invariant cache hit.
[2023-03-09 20:17:52] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 20:17:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 20:17:52] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:52] [INFO ] After 160ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:52] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:17:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:17:52] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:52] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:52] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:17:52] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:17:53] [INFO ] Invariant cache hit.
[2023-03-09 20:17:53] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-09 20:17:53] [INFO ] Invariant cache hit.
[2023-03-09 20:17:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:17:54] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2023-03-09 20:17:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:17:54] [INFO ] Invariant cache hit.
[2023-03-09 20:17:55] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2028 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
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 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 11 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:17:55] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:17:55] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:17:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:17:55] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:17:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:17:55] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:17:55] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:17:55] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623072 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623072 steps, saw 311608 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:17:58] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 20:17:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:17:58] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:17:58] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:17:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:17:58] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:17:58] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:17:58] [INFO ] After 80ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:17:58] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:17:58] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660763 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660763 steps, saw 330456 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:18:02] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:18:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:18:02] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:18:02] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:02] [INFO ] After 65ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:02] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:18:02] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:18:02] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:02] [INFO ] After 73ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:02] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:18:02] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:18:02] [INFO ] Invariant cache hit.
[2023-03-09 20:18:03] [INFO ] Implicit Places using invariants in 418 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 431 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:18:03] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:18:03] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-09 20:18:03] [INFO ] Invariant cache hit.
[2023-03-09 20:18:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:05] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2480 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665799 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665799 steps, saw 332970 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:18:08] [INFO ] Invariant cache hit.
[2023-03-09 20:18:08] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:18:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:18:08] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:08] [INFO ] After 189ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:18:08] [INFO ] After 209ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:18:08] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:18:08] [INFO ] Invariant cache hit.
[2023-03-09 20:18:08] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-09 20:18:08] [INFO ] Invariant cache hit.
[2023-03-09 20:18:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:10] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-09 20:18:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:18:10] [INFO ] Invariant cache hit.
[2023-03-09 20:18:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2223 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
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 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 17 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:18:10] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:18:10] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:18:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:18:11] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:18:11] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:18:11] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:18:11] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661112 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661112 steps, saw 330634 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:18:14] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:18:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:18:14] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:18:14] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:18:14] [INFO ] After 55ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:14] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:18:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:18:14] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:14] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:14] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:18:14] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 83 place count 227 transition count 220
Applied a total of 83 rules in 24 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634000 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634000 steps, saw 317073 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:18:18] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:18:18] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-09 20:18:18] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 17 ms returned sat
[2023-03-09 20:18:18] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2023-03-09 20:18:18] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 28 ms returned sat
[2023-03-09 20:18:18] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:19] [INFO ] After 308ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:19] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:18:19] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:18:19] [INFO ] Invariant cache hit.
[2023-03-09 20:18:19] [INFO ] Implicit Places using invariants in 487 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 507 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 14 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:18:19] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:18:19] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-09 20:18:19] [INFO ] Invariant cache hit.
[2023-03-09 20:18:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:22] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2964 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626092 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626092 steps, saw 313120 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:18:25] [INFO ] Invariant cache hit.
[2023-03-09 20:18:25] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:18:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:18:25] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:25] [INFO ] After 42ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:18:25] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:18:25] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:18:25] [INFO ] Invariant cache hit.
[2023-03-09 20:18:25] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-09 20:18:25] [INFO ] Invariant cache hit.
[2023-03-09 20:18:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:27] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2023-03-09 20:18:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:18:27] [INFO ] Invariant cache hit.
[2023-03-09 20:18:28] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2780 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 10 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 20:18:28] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 20:18:28] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:18:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:18:28] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:18:28] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:28] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 20:18:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:18:28] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:28] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:28] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-09 20:18:28] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-09 20:18:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-03-09 20:18:28] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:18:28] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 640714 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640714 steps, saw 320430 distinct states, run finished after 3004 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:18:31] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:18:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:18:32] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:18:32] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:18:32] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:18:32] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:18:32] [INFO ] After 106ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:32] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:18:32] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 658328 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 658328 steps, saw 329235 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:18:35] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 20:18:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:18:35] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:18:35] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:36] [INFO ] After 158ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:36] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:18:36] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 20:18:36] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:36] [INFO ] After 120ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:36] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:18:36] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-09 20:18:36] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2023-03-09 20:18:36] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-03-09 20:18:37] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-09 20:18:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 554 ms
[2023-03-09 20:18:37] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:18:37] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:18:37] [INFO ] Invariant cache hit.
[2023-03-09 20:18:37] [INFO ] Implicit Places using invariants in 404 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 424 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 6 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:18:37] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:18:37] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 20:18:37] [INFO ] Invariant cache hit.
[2023-03-09 20:18:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:39] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2662 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662915 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662915 steps, saw 331532 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:18:42] [INFO ] Invariant cache hit.
[2023-03-09 20:18:42] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:18:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:18:43] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:18:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:18:43] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:43] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:43] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 20:18:43] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:18:43] [INFO ] Invariant cache hit.
[2023-03-09 20:18:43] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 20:18:43] [INFO ] Invariant cache hit.
[2023-03-09 20:18:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:45] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2023-03-09 20:18:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:18:45] [INFO ] Invariant cache hit.
[2023-03-09 20:18:45] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2229 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
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 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:18:45] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:18:45] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:18:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:18:45] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 20:18:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:18:46] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:18:46] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:46] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:18:46] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624126 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 624126 steps, saw 312135 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:18:49] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:18:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:18:49] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:18:49] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:18:49] [INFO ] After 105ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:18:49] [INFO ] After 129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:18:49] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 14 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642467 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642467 steps, saw 321306 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:18:52] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:18:52] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 20:18:52] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-09 20:18:52] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 20:18:52] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-09 20:18:53] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:53] [INFO ] After 160ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:53] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:18:53] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:18:53] [INFO ] Invariant cache hit.
[2023-03-09 20:18:53] [INFO ] Implicit Places using invariants in 408 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 418 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 214 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 213
Applied a total of 14 rules in 7 ms. Remains 207 /214 variables (removed 7) and now considering 213/220 (removed 7) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 20:18:53] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:18:53] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-09 20:18:53] [INFO ] Invariant cache hit.
[2023-03-09 20:18:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:55] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/227 places, 213/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2427 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 682752 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682752 steps, saw 341448 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:18:58] [INFO ] Invariant cache hit.
[2023-03-09 20:18:58] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:18:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:18:58] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:18:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:18:58] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:58] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:18:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:18:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 20:18:59] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:59] [INFO ] After 55ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:18:59] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:18:59] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:18:59] [INFO ] Invariant cache hit.
[2023-03-09 20:18:59] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-09 20:18:59] [INFO ] Invariant cache hit.
[2023-03-09 20:18:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:01] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2023-03-09 20:19:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:19:01] [INFO ] Invariant cache hit.
[2023-03-09 20:19:01] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2376 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 11 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:19:01] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 20:19:01] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:19:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:19:01] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:19:01] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:19:02] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-09 20:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-09 20:19:02] [INFO ] After 148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:02] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:19:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:19:02] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:02] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:02] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-09 20:19:02] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-09 20:19:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-09 20:19:02] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:19:02] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1482 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 584561 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 584561 steps, saw 292341 distinct states, run finished after 3005 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:19:05] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 20:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:19:05] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 20:19:06] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:19:06] [INFO ] After 199ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:06] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:19:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:19:06] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:06] [INFO ] After 182ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:06] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:19:06] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 20 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 556265 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 556265 steps, saw 278193 distinct states, run finished after 3004 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:19:09] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 20:19:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:19:09] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:19:10] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:10] [INFO ] After 48ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:19:10] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:19:10] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:19:10] [INFO ] Invariant cache hit.
[2023-03-09 20:19:10] [INFO ] Implicit Places using invariants in 611 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 617 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:19:10] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:19:11] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-09 20:19:11] [INFO ] Invariant cache hit.
[2023-03-09 20:19:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:13] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3505 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1477 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602440 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602440 steps, saw 301284 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:19:16] [INFO ] Invariant cache hit.
[2023-03-09 20:19:16] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:19:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:19:16] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:16] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:16] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 20:19:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:19:17] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:17] [INFO ] After 91ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:17] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:19:17] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:19:17] [INFO ] Invariant cache hit.
[2023-03-09 20:19:17] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-09 20:19:17] [INFO ] Invariant cache hit.
[2023-03-09 20:19:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:20] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
[2023-03-09 20:19:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:19:20] [INFO ] Invariant cache hit.
[2023-03-09 20:19:20] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3107 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 18 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:19:20] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 20:19:20] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 20:19:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:19:20] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:19:20] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:20] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 20:19:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:19:21] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:21] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:21] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:19:21] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1410 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619667 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619667 steps, saw 309905 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:19:24] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:19:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:19:24] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:19:24] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:19:24] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:24] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:19:24] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:19:24] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:24] [INFO ] After 80ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:25] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-03-09 20:19:25] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2023-03-09 20:19:25] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-09 20:19:25] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2023-03-09 20:19:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2023-03-09 20:19:25] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:19:25] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618486 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618486 steps, saw 309315 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:19:28] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:19:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:19:28] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 20:19:28] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:28] [INFO ] After 75ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:28] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:19:29] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 20:19:29] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:29] [INFO ] After 99ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:29] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-09 20:19:29] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-09 20:19:29] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:19:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 461 ms
[2023-03-09 20:19:29] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:19:29] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:19:29] [INFO ] Invariant cache hit.
[2023-03-09 20:19:30] [INFO ] Implicit Places using invariants in 680 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 682 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:19:30] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:19:31] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-09 20:19:31] [INFO ] Invariant cache hit.
[2023-03-09 20:19:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:33] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3164 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3866 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 541077 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541077 steps, saw 270602 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:19:36] [INFO ] Invariant cache hit.
[2023-03-09 20:19:36] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-09 20:19:36] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:19:37] [INFO ] After 227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:37] [INFO ] After 90ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:37] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-09 20:19:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-09 20:19:37] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:37] [INFO ] After 149ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:37] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-09 20:19:37] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-09 20:19:38] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-09 20:19:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2023-03-09 20:19:38] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:19:38] [INFO ] After 933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:19:38] [INFO ] Invariant cache hit.
[2023-03-09 20:19:38] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 20:19:38] [INFO ] Invariant cache hit.
[2023-03-09 20:19:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:41] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
[2023-03-09 20:19:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:19:41] [INFO ] Invariant cache hit.
[2023-03-09 20:19:41] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3386 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 19 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:19:41] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 20:19:41] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:19:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:19:41] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:19:41] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:19:41] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 20:19:41] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1378 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 572716 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572716 steps, saw 286422 distinct states, run finished after 3004 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:19:45] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 20:19:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:19:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 20:19:45] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:19:45] [INFO ] After 162ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:45] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:19:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 20:19:45] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:45] [INFO ] After 195ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:46] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:19:46] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 21 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529488 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529488 steps, saw 264805 distinct states, run finished after 3005 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 20:19:49] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 20:19:49] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-09 20:19:49] [INFO ] [Real]Absence check using 6 positive and 38 generalized place invariants in 56 ms returned sat
[2023-03-09 20:19:49] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:49] [INFO ] After 96ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:19:49] [INFO ] After 133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:19:49] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 20:19:49] [INFO ] Invariant cache hit.
[2023-03-09 20:19:50] [INFO ] Implicit Places using invariants in 707 ms returned [25, 45, 50, 71, 76, 97, 103, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 709 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 12 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:19:50] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 20:19:50] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 20:19:50] [INFO ] Invariant cache hit.
[2023-03-09 20:19:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:53] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3655 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1476 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 565445 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565445 steps, saw 282785 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:19:56] [INFO ] Invariant cache hit.
[2023-03-09 20:19:56] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-09 20:19:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:19:56] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:19:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:19:56] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:56] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:19:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-09 20:19:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:19:56] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:57] [INFO ] After 136ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:19:57] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:19:57] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:19:57] [INFO ] Invariant cache hit.
[2023-03-09 20:19:57] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-09 20:19:57] [INFO ] Invariant cache hit.
[2023-03-09 20:19:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:00] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2023-03-09 20:20:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:20:00] [INFO ] Invariant cache hit.
[2023-03-09 20:20:00] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3530 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 22 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 20:20:00] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 20:20:00] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:20:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:20:01] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:20:01] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:20:01] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:01] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 20:20:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:20:01] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:01] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 536 ms
[2023-03-09 20:20:01] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:20:01] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596122 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596122 steps, saw 298128 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:20:05] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 20:20:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:20:05] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 20:20:05] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:20:05] [INFO ] After 42ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:20:05] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-09 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 20:20:05] [INFO ] After 173ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:05] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:20:05] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 20:20:05] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:05] [INFO ] After 80ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:06] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:20:06] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-09 20:20:06] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-09 20:20:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2023-03-09 20:20:06] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 20:20:06] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 23 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598586 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598586 steps, saw 299353 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:20:09] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 20:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 20:20:09] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-09 20:20:09] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:09] [INFO ] After 215ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:09] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-09 20:20:10] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-09 20:20:10] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:10] [INFO ] After 322ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:10] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-09 20:20:10] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-09 20:20:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-09 20:20:10] [INFO ] After 662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:20:10] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:20:10] [INFO ] Invariant cache hit.
[2023-03-09 20:20:11] [INFO ] Implicit Places using invariants in 720 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 721 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 16 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 20:20:11] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 20:20:12] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 20:20:12] [INFO ] Invariant cache hit.
[2023-03-09 20:20:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:14] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3181 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609084 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 609084 steps, saw 304611 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:20:17] [INFO ] Invariant cache hit.
[2023-03-09 20:20:17] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:20:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:20:17] [INFO ] After 209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:17] [INFO ] After 84ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:17] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:20:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-09 20:20:17] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:18] [INFO ] After 130ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:18] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:20:18] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-09 20:20:18] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-09 20:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-09 20:20:18] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:20:18] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:20:18] [INFO ] Invariant cache hit.
[2023-03-09 20:20:18] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 20:20:18] [INFO ] Invariant cache hit.
[2023-03-09 20:20:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:20] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2023-03-09 20:20:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:20:20] [INFO ] Invariant cache hit.
[2023-03-09 20:20:21] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2746 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
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 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 15 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 20:20:21] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 20:20:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 20:20:21] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-09 20:20:21] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:20:21] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:20:21] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-09 20:20:21] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-09 20:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-09 20:20:21] [INFO ] After 266ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:21] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 20:20:21] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-09 20:20:22] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:22] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:22] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-09 20:20:22] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-09 20:20:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-09 20:20:22] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:20:22] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 561939 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561939 steps, saw 281033 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:20:25] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 20:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:20:25] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 20:20:25] [INFO ] After 267ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:20:25] [INFO ] After 60ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:25] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:20:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 20:20:26] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:26] [INFO ] After 59ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:26] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:20:26] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589011 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589011 steps, saw 294569 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 20:20:29] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-09 20:20:29] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-09 20:20:29] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:20:29] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:30] [INFO ] After 285ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:30] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 42 ms returned sat
[2023-03-09 20:20:30] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 20:20:30] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:31] [INFO ] After 584ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:31] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:20:31] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 20:20:31] [INFO ] Invariant cache hit.
[2023-03-09 20:20:31] [INFO ] Implicit Places using invariants in 485 ms returned [25, 45, 50, 71, 76, 96, 125, 130, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 486 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 14 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 20:20:31] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 20:20:31] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 20:20:31] [INFO ] Invariant cache hit.
[2023-03-09 20:20:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:34] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3176 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597550 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597550 steps, saw 298837 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:20:37] [INFO ] Invariant cache hit.
[2023-03-09 20:20:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 20:20:37] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:20:37] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:37] [INFO ] After 124ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:37] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2023-03-09 20:20:37] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:20:37] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:38] [INFO ] After 174ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:38] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:20:38] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 20:20:38] [INFO ] Invariant cache hit.
[2023-03-09 20:20:38] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-09 20:20:38] [INFO ] Invariant cache hit.
[2023-03-09 20:20:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:41] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 3141 ms to find 0 implicit places.
[2023-03-09 20:20:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:20:41] [INFO ] Invariant cache hit.
[2023-03-09 20:20:41] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3475 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 19 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 20:20:41] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 20:20:41] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 20:20:41] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:20:42] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:20:42] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:20:42] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-09 20:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 20:20:42] [INFO ] After 191ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:42] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-09 20:20:42] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 20:20:42] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:42] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:42] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-09 20:20:42] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-09 20:20:42] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:20:42] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1475 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 576577 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 576577 steps, saw 288350 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:20:45] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:20:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:20:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:20:46] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:20:46] [INFO ] After 48ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:20:46] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-09 20:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 20:20:46] [INFO ] After 165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:46] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:20:46] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 20:20:46] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:46] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:46] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 20:20:46] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 14 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644502 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644502 steps, saw 322322 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:20:49] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 20:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:20:49] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:20:49] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:20:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:50] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:50] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:20:50] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:20:50] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:50] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2023-03-09 20:20:50] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-09 20:20:50] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:20:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2023-03-09 20:20:50] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:20:50] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:20:50] [INFO ] Invariant cache hit.
[2023-03-09 20:20:51] [INFO ] Implicit Places using invariants in 477 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 479 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:20:51] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:20:51] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-09 20:20:51] [INFO ] Invariant cache hit.
[2023-03-09 20:20:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:53] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2543 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654301 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654301 steps, saw 327223 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:20:56] [INFO ] Invariant cache hit.
[2023-03-09 20:20:56] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:20:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 20:20:56] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:20:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 20:20:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:20:56] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:57] [INFO ] After 297ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:20:57] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-09 20:20:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-09 20:20:57] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:20:57] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-09 20:20:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 351 ms
[2023-03-09 20:20:57] [INFO ] After 661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:20:57] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:20:57] [INFO ] Invariant cache hit.
[2023-03-09 20:20:57] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-09 20:20:57] [INFO ] Invariant cache hit.
[2023-03-09 20:20:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:20:59] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2023-03-09 20:20:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:20:59] [INFO ] Invariant cache hit.
[2023-03-09 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2324 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
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 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 20:20:59] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:20:59] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 20:20:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:21:00] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-09 20:21:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 20:21:00] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:00] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:00] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-09 20:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 20:21:00] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:21:00] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 630546 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 630546 steps, saw 315347 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:21:03] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 20:21:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:21:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:21:03] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:21:03] [INFO ] After 79ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:03] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:21:03] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:21:03] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:04] [INFO ] After 279ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:04] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:21:04] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-09 20:21:04] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:21:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-09 20:21:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 384 ms
[2023-03-09 20:21:04] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-09 20:21:04] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641258 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641258 steps, saw 320703 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 20:21:07] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:21:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:21:07] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:21:08] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:08] [INFO ] After 68ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:08] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:21:08] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:21:08] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:08] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:08] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:21:08] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2023-03-09 20:21:08] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 1 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 0 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 1 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 0 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2023-03-09 20:21:09] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-09 20:21:10] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:21:10] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-03-09 20:21:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1702 ms
[2023-03-09 20:21:10] [INFO ] After 1808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:21:10] [INFO ] After 2051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 20:21:10] [INFO ] Invariant cache hit.
[2023-03-09 20:21:10] [INFO ] Implicit Places using invariants in 409 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 410 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 20:21:10] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 20:21:10] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 20:21:10] [INFO ] Invariant cache hit.
[2023-03-09 20:21:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:12] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2558 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593607 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593607 steps, saw 296871 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:21:15] [INFO ] Invariant cache hit.
[2023-03-09 20:21:15] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 20:21:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 20:21:15] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:16] [INFO ] After 136ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:16] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 20:21:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:21:16] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:16] [INFO ] After 118ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:16] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2023-03-09 20:21:16] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2023-03-09 20:21:16] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 0 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 0 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 1 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 0 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2023-03-09 20:21:17] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:21:18] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-09 20:21:18] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2023-03-09 20:21:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1738 ms
[2023-03-09 20:21:18] [INFO ] After 1872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 20:21:18] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 20:21:18] [INFO ] Invariant cache hit.
[2023-03-09 20:21:18] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 20:21:18] [INFO ] Invariant cache hit.
[2023-03-09 20:21:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:20] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2023-03-09 20:21:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:21:20] [INFO ] Invariant cache hit.
[2023-03-09 20:21:21] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2917 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
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 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 10 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 20:21:21] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 20:21:21] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:21:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-09 20:21:21] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:21] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:21] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 20:21:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 20:21:21] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:21] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-09 20:21:21] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:21:21] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634940 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634940 steps, saw 317544 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 20:21:24] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:21:24] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 20:21:25] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 20:21:25] [INFO ] After 94ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:25] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:21:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 20:21:25] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:25] [INFO ] After 129ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:25] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:21:25] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 21 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 595094 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595094 steps, saw 297610 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 20:21:28] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 20:21:28] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-09 20:21:28] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-09 20:21:29] [INFO ] After 259ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:29] [INFO ] After 198ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:29] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2023-03-09 20:21:29] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-09 20:21:29] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:29] [INFO ] After 180ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:29] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:21:30] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 20:21:30] [INFO ] Invariant cache hit.
[2023-03-09 20:21:30] [INFO ] Implicit Places using invariants in 680 ms returned [25, 45, 50, 71, 76, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 682 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 16 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 20:21:30] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 20:21:31] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 20:21:31] [INFO ] Invariant cache hit.
[2023-03-09 20:21:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:33] [INFO ] Implicit Places using invariants and state equation in 2613 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3723 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636828 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636828 steps, saw 318487 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:21:36] [INFO ] Invariant cache hit.
[2023-03-09 20:21:36] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-09 20:21:36] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 10 ms returned sat
[2023-03-09 20:21:37] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:37] [INFO ] After 172ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:21:37] [INFO ] After 205ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 20:21:37] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:21:37] [INFO ] Invariant cache hit.
[2023-03-09 20:21:37] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-09 20:21:37] [INFO ] Invariant cache hit.
[2023-03-09 20:21:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 20:21:40] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 2872 ms to find 0 implicit places.
[2023-03-09 20:21:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:21:40] [INFO ] Invariant cache hit.
[2023-03-09 20:21:40] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3201 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 20 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 20:21:40] [INFO ] Computed 32 place invariants in 16 ms
[2023-03-09 20:21:40] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 20:21:40] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 20:21:40] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:21:40] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 20:21:40] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 20:21:40] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13949428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16126836 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-010, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-smll-167819438100297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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