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.r153-smll-167819440300297.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 smartxred
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 r153-smll-167819440300297
=====================================================================

--------------------
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 1678404418530

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 23:27:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 23:27:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:27:02] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-09 23:27:02] [INFO ] Transformed 534 places.
[2023-03-09 23:27:02] [INFO ] Transformed 498 transitions.
[2023-03-09 23:27:02] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 317 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 30 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 3 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 229 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 23:27:02] [INFO ] Computed 51 place invariants in 84 ms
[2023-03-09 23:27:03] [INFO ] Implicit Places using invariants in 667 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 724 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 3 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 20 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 23:27:03] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-09 23:27:03] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-09 23:27:03] [INFO ] Invariant cache hit.
[2023-03-09 23:27:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 23:27:05] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2189 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 3162 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 1243 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 201) seen :14
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) 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 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 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 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 6 ms. (steps per millisecond=16 ) 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 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 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 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 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 8 resets, run finished after 3 ms. (steps per millisecond=33 ) 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 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 4 ms. (steps per millisecond=25 ) 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 6 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=33 ) 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 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 8 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 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 5 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 3 ms. (steps per millisecond=33 ) 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 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 7 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 8 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 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 7 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 4 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 3 ms. (steps per millisecond=33 ) 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 100 steps, including 5 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 4 ms. (steps per millisecond=25 ) 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 8 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 7 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 3 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 8 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 4 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 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 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Interrupted probabilistic random walk after 70919 steps, run timeout after 3001 ms. (steps per millisecond=23 ) 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 70919 steps, saw 35466 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :35
Running SMT prover for 152 properties.
[2023-03-09 23:27:09] [INFO ] Invariant cache hit.
[2023-03-09 23:27:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:27:10] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 23 ms returned sat
[2023-03-09 23:27:15] [INFO ] After 3584ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:149
[2023-03-09 23:27:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 23:27:15] [INFO ] After 156ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 23:27:15] [INFO ] After 5834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 23:27:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 23:27:16] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 34 ms returned sat
[2023-03-09 23:27:23] [INFO ] After 4818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :152
[2023-03-09 23:27:31] [INFO ] After 8808ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :152
[2023-03-09 23:27:32] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 12 ms to minimize.
[2023-03-09 23:27:32] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2023-03-09 23:27:32] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2023-03-09 23:27:32] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-09 23:27:32] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-09 23:27:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 908 ms
[2023-03-09 23:27:33] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-09 23:27:34] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2023-03-09 23:27:34] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-09 23:27:34] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-09 23:27:34] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-09 23:27:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 767 ms
[2023-03-09 23:27:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-09 23:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-09 23:27:35] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-09 23:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 23:27:36] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-09 23:27:36] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:27:36] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-09 23:27:36] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2023-03-09 23:27:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2023-03-09 23:27:37] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-03-09 23:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 23:27:37] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-03-09 23:27:37] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-09 23:27:37] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 4 ms to minimize.
[2023-03-09 23:27:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-09 23:27:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-09 23:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-09 23:27:39] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 5 ms to minimize.
[2023-03-09 23:27:39] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-09 23:27:39] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2023-03-09 23:27:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2023-03-09 23:27:39] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-09 23:27:39] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-09 23:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2023-03-09 23:27:40] [INFO ] After 17263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :151
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 23:27:40] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :151
Parikh walk visited 0 properties in 30397 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 66 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 66 ms. Remains : 266/272 places, 254/260 transitions.
Interrupted random walk after 775643 steps, including 99415 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 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 846 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 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 829 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 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 244 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 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 848 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 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 822 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 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 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 843 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 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 832 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 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 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 836 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 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 866 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 838 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 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 889 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 860 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 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 880 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 855 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 849 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 860 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 235 ms. (steps per millisecond=42 ) 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 20974 ms. (steps per millisecond=41 ) properties seen :7
Interrupted probabilistic random walk after 5007458 steps, run timeout after 126001 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 5007458 steps, saw 2503936 distinct states, run finished after 126009 ms. (steps per millisecond=39 ) properties seen :14
Running SMT prover for 131 properties.
// Phase 1: matrix 254 rows 266 cols
[2023-03-09 23:31:20] [INFO ] Computed 49 place invariants in 17 ms
[2023-03-09 23:31:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:31:21] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-09 23:31:24] [INFO ] After 2680ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 23:31:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 23:31:25] [INFO ] After 134ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:31:25] [INFO ] After 4506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:31:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:31:25] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 23:31:29] [INFO ] After 2483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 23:31:33] [INFO ] After 4168ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 23:31:33] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-09 23:31:33] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-09 23:31:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-03-09 23:31:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-09 23:31:38] [INFO ] After 8946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4249 ms.
[2023-03-09 23:31:42] [INFO ] After 17242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30398 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 35 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 35 ms. Remains : 262/266 places, 250/254 transitions.
Interrupted random walk after 875580 steps, including 112162 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 814 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 835 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 836 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 843 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 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 873 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 864 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 859 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 871 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 835 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 866 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 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 843 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 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 863 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 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 862 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 837 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 831 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 832 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 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 823 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 848 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 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 875 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 882 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 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 835 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 840 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 833 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 838 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 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 854 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 855 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 849 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 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 846 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 834 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 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 859 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 4899163 steps, run timeout after 129001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 4899163 steps, saw 2449425 distinct states, run finished after 129005 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 131 properties.
// Phase 1: matrix 250 rows 262 cols
[2023-03-09 23:35:05] [INFO ] Computed 49 place invariants in 18 ms
[2023-03-09 23:35:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:35:06] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 23:35:12] [INFO ] After 4196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 23:35:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:35:12] [INFO ] After 210ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:35:12] [INFO ] After 6557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:35:13] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-09 23:35:18] [INFO ] After 3830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 23:35:24] [INFO ] After 6398ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 23:35:25] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2023-03-09 23:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-09 23:35:25] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-09 23:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-09 23:35:25] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 604 ms
[2023-03-09 23:35:27] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-09 23:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-09 23:35:27] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-09 23:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 23:35:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-09 23:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-09 23:35:29] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-09 23:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 23:35:30] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-09 23:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 23:35:30] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-03-09 23:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-09 23:35:30] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2023-03-09 23:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-09 23:35:31] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2023-03-09 23:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:35:31] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-03-09 23:35:31] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2023-03-09 23:35:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-09 23:35:35] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2023-03-09 23:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 23:35:35] [INFO ] After 17041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 7101 ms.
[2023-03-09 23:35:42] [INFO ] After 30461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30121 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 12 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 14 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:13] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 23:36:13] [INFO ] Invariant cache hit.
[2023-03-09 23:36:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:36:14] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned [20, 144, 214, 253, 259]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1247 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 257/262 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 248
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 255 transition count 248
Applied a total of 5 rules in 46 ms. Remains 255 /257 variables (removed 2) and now considering 248/250 (removed 2) transitions.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:36:14] [INFO ] Computed 44 place invariants in 29 ms
[2023-03-09 23:36:14] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 23:36:14] [INFO ] Invariant cache hit.
[2023-03-09 23:36:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:36:15] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/262 places, 248/250 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2852 ms. Remains : 255/262 places, 248/250 transitions.
Interrupted random walk after 877290 steps, including 126419 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 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 934 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 913 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 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 891 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 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 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 915 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 913 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 908 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 901 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 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 872 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 897 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 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 894 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 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 906 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 893 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 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 916 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 898 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 929 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 924 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 912 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 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 10001 steps, including 915 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 904 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 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 925 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 908 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 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 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 891 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 927 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 900 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 917 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 893 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 886 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 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 917 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 923 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 892 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 912 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 869 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 882 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 939 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5023945 steps, run timeout after 120001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 5023945 steps, saw 2511650 distinct states, run finished after 120003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 23:38:56] [INFO ] Invariant cache hit.
[2023-03-09 23:38:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:38:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:39:01] [INFO ] After 3010ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:128
[2023-03-09 23:39:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:39:01] [INFO ] After 170ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :3 real:128
[2023-03-09 23:39:01] [INFO ] After 300ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:39:01] [INFO ] After 4972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:39:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:39:02] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:39:05] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 23:39:09] [INFO ] After 3874ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 23:39:13] [INFO ] After 7814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4140 ms.
[2023-03-09 23:39:17] [INFO ] After 16032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30881 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 12 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 16 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 23:39:48] [INFO ] Invariant cache hit.
[2023-03-09 23:39:48] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 23:39:48] [INFO ] Invariant cache hit.
[2023-03-09 23:39:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:39:49] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-09 23:39:49] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 23:39:49] [INFO ] Invariant cache hit.
[2023-03-09 23:39: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 1071 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14444 resets, run finished after 4581 ms. (steps per millisecond=21 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 23:39:54] [INFO ] Invariant cache hit.
[2023-03-09 23:39:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:39:54] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:39:55] [INFO ] After 674ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 23:39:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:39:55] [INFO ] After 957ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 23:39:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-09 23:39:56] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2023-03-09 23:39:56] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 12 ms to minimize.
[2023-03-09 23:39:56] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2023-03-09 23:39:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 292 ms
[2023-03-09 23:39:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 4 ms to minimize.
[2023-03-09 23:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-03-09 23:39:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2023-03-09 23:39:58] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-09 23:39:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 338 ms
[2023-03-09 23:39:58] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2023-03-09 23:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:39:58] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-03-09 23:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 23:39:59] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 6 ms to minimize.
[2023-03-09 23:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 23:40:00] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-09 23:40:00] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2023-03-09 23:40:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-09 23:40:00] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-03-09 23:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 23:40:01] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2023-03-09 23:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 23:40:01] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-03-09 23:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 23:40:04] [INFO ] After 9314ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 23:40:04] [INFO ] After 10222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 23:40:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 23:40:04] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:40:05] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 23:40:06] [INFO ] After 1388ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 523 ms
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 3 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 17 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-09 23:40:07] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2023-03-09 23:40:08] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2023-03-09 23:40:09] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1907 ms
[2023-03-09 23:40:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-09 23:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 23:40:10] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-09 23:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 23:40:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-09 23:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 23:40:12] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2023-03-09 23:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 23:40:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2023-03-09 23:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 23:40:13] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-09 23:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 23:40:15] [INFO ] After 9645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 4149 ms.
[2023-03-09 23:40:19] [INFO ] After 14977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Interrupted random walk after 898436 steps, including 129600 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 904 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 895 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 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 885 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 929 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 946 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 945 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 916 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 910 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 889 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 910 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 930 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 934 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 896 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 890 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 925 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 900 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 932 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 897 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 920 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 896 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 919 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 931 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 907 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 927 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 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 872 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 4785023 steps, run timeout after 120001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 4785023 steps, saw 2392228 distinct states, run finished after 120002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 23:43:00] [INFO ] Invariant cache hit.
[2023-03-09 23:43:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:43:00] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:43:05] [INFO ] After 3285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:128
[2023-03-09 23:43:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:43:05] [INFO ] After 172ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :3 real:128
[2023-03-09 23:43:05] [INFO ] After 305ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:43:05] [INFO ] After 5162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 23:43:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:43:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 17 ms returned sat
[2023-03-09 23:43:09] [INFO ] After 2416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 23:43:13] [INFO ] After 3760ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 23:43:17] [INFO ] After 7715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4388 ms.
[2023-03-09 23:43:21] [INFO ] After 16074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30172 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 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 23:43:51] [INFO ] Invariant cache hit.
[2023-03-09 23:43:51] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 23:43:51] [INFO ] Invariant cache hit.
[2023-03-09 23:43:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:43:52] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-09 23:43:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:43:52] [INFO ] Invariant cache hit.
[2023-03-09 23:43:52] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 937 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14431 resets, run finished after 3875 ms. (steps per millisecond=25 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 23:43:56] [INFO ] Invariant cache hit.
[2023-03-09 23:43:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:43:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:43:57] [INFO ] After 693ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 23:43:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:43:58] [INFO ] After 989ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 23:43:58] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-09 23:43:58] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-09 23:43:58] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2023-03-09 23:43:58] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-09 23:43:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2023-03-09 23:43:59] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-03-09 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:43:59] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2023-03-09 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 23:43:59] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-09 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 23:43:59] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-09 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 23:43:59] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-09 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 335 ms
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 23:44:00] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
[2023-03-09 23:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 23:44:01] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2023-03-09 23:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 23:44:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2023-03-09 23:44:02] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-03-09 23:44:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-09 23:44:02] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2023-03-09 23:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 23:44:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2023-03-09 23:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-09 23:44:03] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-09 23:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-09 23:44:06] [INFO ] After 8790ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 23:44:06] [INFO ] After 9699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 23:44:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 23:44:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 23:44:07] [INFO ] After 1065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 23:44:08] [INFO ] After 1370ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 23:44:08] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2023-03-09 23:44:08] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 429 ms
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-03-09 23:44:09] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2023-03-09 23:44:10] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2023-03-09 23:44:11] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2023-03-09 23:44:11] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2023-03-09 23:44:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1901 ms
[2023-03-09 23:44:11] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-09 23:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 23:44:12] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-09 23:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-09 23:44:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-09 23:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 23:44:13] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2023-03-09 23:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 23:44:14] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2023-03-09 23:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 23:44:15] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2023-03-09 23:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 23:44:17] [INFO ] After 9689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 4157 ms.
[2023-03-09 23:44:21] [INFO ] After 15150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 610431 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610431 steps, saw 305279 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:44:24] [INFO ] Invariant cache hit.
[2023-03-09 23:44:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:44:24] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:44:24] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:44:24] [INFO ] After 58ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:24] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:44:24] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:44:24] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:25] [INFO ] After 85ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:25] [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 13 ms.
[2023-03-09 23:44:25] [INFO ] After 377ms 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.3 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 1425 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 934 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 611513 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 611513 steps, saw 305822 distinct states, run finished after 3004 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 23:44:28] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-09 23:44:28] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:44:28] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:28] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:28] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:44:28] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:44:28] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:28] [INFO ] After 75ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:28] [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 14 ms.
[2023-03-09 23:44:28] [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 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 10 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 12 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 11 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 23:44:28] [INFO ] Invariant cache hit.
[2023-03-09 23:44:29] [INFO ] Implicit Places using invariants in 508 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 510 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 20 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 23:44:29] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 23:44:29] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-09 23:44:29] [INFO ] Invariant cache hit.
[2023-03-09 23:44:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:31] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2326 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 2867 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625880 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625880 steps, saw 313015 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:44:34] [INFO ] Invariant cache hit.
[2023-03-09 23:44:34] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:44:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:44:34] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:34] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:34] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 23:44:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:44:35] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:35] [INFO ] After 32ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:35] [INFO ] After 52ms 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 23:44:35] [INFO ] After 259ms 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 7 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 7 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 23:44:35] [INFO ] Invariant cache hit.
[2023-03-09 23:44:35] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-09 23:44:35] [INFO ] Invariant cache hit.
[2023-03-09 23:44:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:37] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
[2023-03-09 23:44:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:44:37] [INFO ] Invariant cache hit.
[2023-03-09 23:44:37] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2340 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 28 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 23:44:37] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:44:37] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:44:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:44:37] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:44:37] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:37] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:44:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 23:44:37] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:37] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:38] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2023-03-09 23:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 23:44:38] [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 9 ms.
[2023-03-09 23:44:38] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623447 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623447 steps, saw 311796 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 23:44:41] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:44:41] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:44:41] [INFO ] After 188ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:44:41] [INFO ] After 30ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:41] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:44:41] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 23:44:41] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:41] [INFO ] After 35ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:41] [INFO ] After 60ms 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 23:44:41] [INFO ] After 372ms 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.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 38 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 39 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1473 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635746 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635746 steps, saw 317945 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 23:44:44] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:44:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:44:44] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 23:44:45] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:45] [INFO ] After 125ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:45] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:44:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:44:45] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:45] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:45] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-09 23:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 23:44:45] [INFO ] After 216ms 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 23:44:45] [INFO ] After 439ms 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 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 23:44:45] [INFO ] Invariant cache hit.
[2023-03-09 23:44:46] [INFO ] Implicit Places using invariants in 519 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 522 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 23:44:46] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 23:44:46] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 23:44:46] [INFO ] Invariant cache hit.
[2023-03-09 23:44:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:48] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 2658 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 3204 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1431 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 925 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631617 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631617 steps, saw 315886 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:44:51] [INFO ] Invariant cache hit.
[2023-03-09 23:44:51] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:44:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:44:52] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:52] [INFO ] After 186ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:52] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:44:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 23:44:52] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:52] [INFO ] After 224ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:52] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2023-03-09 23:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 23:44:52] [INFO ] After 363ms 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 23:44:52] [INFO ] After 598ms 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 11 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 11 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 23:44:52] [INFO ] Invariant cache hit.
[2023-03-09 23:44:53] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-09 23:44:53] [INFO ] Invariant cache hit.
[2023-03-09 23:44:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:44:54] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2023-03-09 23:44:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:44:54] [INFO ] Invariant cache hit.
[2023-03-09 23:44:55] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2239 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 20 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 23:44:55] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:44:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:44:55] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 23:44:55] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:44:55] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:44:55] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-09 23:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 23:44:55] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:55] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:44:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:44:55] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 23:44:55] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:55] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:44:55] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2023-03-09 23:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:44:55] [INFO ] After 126ms 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 23:44:55] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1463 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 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 582322 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 582322 steps, saw 291227 distinct states, run finished after 3004 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:44:58] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:44:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:44:58] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:44:59] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:44:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:44:59] [INFO ] After 42ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:44:59] [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 21 ms.
[2023-03-09 23:44:59] [INFO ] After 485ms 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.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 26 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 1417 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 910 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627480 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627480 steps, saw 313814 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:45:02] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:45:02] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-09 23:45:02] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 23:45:02] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:02] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:02] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 45 ms returned sat
[2023-03-09 23:45:02] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 23:45:03] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:03] [INFO ] After 181ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:03] [INFO ] After 216ms 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 23:45:03] [INFO ] After 599ms 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 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 8 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 8 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 8 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 23:45:03] [INFO ] Invariant cache hit.
[2023-03-09 23:45:03] [INFO ] Implicit Places using invariants in 499 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 515 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 22 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 23:45:03] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 23:45:04] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-09 23:45:04] [INFO ] Invariant cache hit.
[2023-03-09 23:45:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:06] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned []
Implicit Place search using SMT with State Equation took 2835 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 3382 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1444 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 598056 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598056 steps, saw 299090 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:45:09] [INFO ] Invariant cache hit.
[2023-03-09 23:45:09] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 23:45:09] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:45:10] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:10] [INFO ] After 93ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:10] [INFO ] After 124ms 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 23:45:10] [INFO ] After 424ms 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 7 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 7 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 8 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 23:45:10] [INFO ] Invariant cache hit.
[2023-03-09 23:45:10] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-09 23:45:10] [INFO ] Invariant cache hit.
[2023-03-09 23:45:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:12] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2023-03-09 23:45:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:45:12] [INFO ] Invariant cache hit.
[2023-03-09 23:45:13] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2800 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 32 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 23:45:13] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 23:45:13] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-09 23:45:13] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 23:45:13] [INFO ] After 192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:45:13] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:13] [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 23:45:13] [INFO ] After 346ms 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 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 565717 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565717 steps, saw 282919 distinct states, run finished after 3004 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:45:16] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:45:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:45:16] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:45:16] [INFO ] After 223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:45:16] [INFO ] After 64ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:16] [INFO ] After 95ms 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 23:45:16] [INFO ] After 451ms 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 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 24 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1446 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 925 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620168 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620168 steps, saw 310154 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 23:45:20] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:45:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:45:20] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 23:45:20] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:20] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:20] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:45:20] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:45:20] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:20] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:20] [INFO ] After 66ms 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 23:45:20] [INFO ] After 360ms 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 9 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 23:45:20] [INFO ] Invariant cache hit.
[2023-03-09 23:45:21] [INFO ] Implicit Places using invariants in 680 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 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 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 23:45:21] [INFO ] Computed 32 place invariants in 15 ms
[2023-03-09 23:45:21] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-09 23:45:21] [INFO ] Invariant cache hit.
[2023-03-09 23:45:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:24] [INFO ] Implicit Places using invariants and state equation in 2705 ms returned []
Implicit Place search using SMT with State Equation took 3131 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 3840 ms. Remains : 209/227 places, 214/220 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 10000 steps, including 920 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665138 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665138 steps, saw 332642 distinct states, run finished after 3004 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:45:27] [INFO ] Invariant cache hit.
[2023-03-09 23:45:27] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-09 23:45:27] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:45:27] [INFO ] After 214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:28] [INFO ] After 229ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:28] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-09 23:45:28] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:45:28] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:28] [INFO ] After 81ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:28] [INFO ] After 111ms 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 23:45:28] [INFO ] After 483ms 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 7 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 7 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 23:45:28] [INFO ] Invariant cache hit.
[2023-03-09 23:45:29] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-09 23:45:29] [INFO ] Invariant cache hit.
[2023-03-09 23:45:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:32] [INFO ] Implicit Places using invariants and state equation in 3764 ms returned []
Implicit Place search using SMT with State Equation took 4186 ms to find 0 implicit places.
[2023-03-09 23:45:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:45:32] [INFO ] Invariant cache hit.
[2023-03-09 23:45:33] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4503 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 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 27 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 23:45:33] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 23:45:33] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 23:45:33] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:45:33] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:45:33] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:33] [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 23:45:33] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1455 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 903 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575209 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575209 steps, saw 287668 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:45:36] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 23:45:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:45:36] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:45:36] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:45:37] [INFO ] After 88ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:37] [INFO ] After 124ms 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 23:45:37] [INFO ] After 545ms 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 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 28 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 28 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1442 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 885 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597735 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597735 steps, saw 298931 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:45:40] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:45:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:45:40] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 23:45:40] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:40] [INFO ] After 163ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:40] [INFO ] After 196ms 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 23:45:40] [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 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 12 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 13 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 23:45:40] [INFO ] Invariant cache hit.
[2023-03-09 23:45:41] [INFO ] Implicit Places using invariants in 579 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 581 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 14 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 23:45:41] [INFO ] Computed 33 place invariants in 19 ms
[2023-03-09 23:45:41] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-09 23:45:41] [INFO ] Invariant cache hit.
[2023-03-09 23:45:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:45] [INFO ] Implicit Places using invariants and state equation in 3474 ms returned []
Implicit Place search using SMT with State Equation took 3901 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 4505 ms. Remains : 212/229 places, 216/222 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 918 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529172 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529172 steps, saw 264649 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:45:48] [INFO ] Invariant cache hit.
[2023-03-09 23:45:48] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 23:45:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-09 23:45:48] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:48] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:48] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-09 23:45:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-09 23:45:48] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:48] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:48] [INFO ] After 90ms 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 23:45:48] [INFO ] After 443ms 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 7 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 23:45:48] [INFO ] Invariant cache hit.
[2023-03-09 23:45:49] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-09 23:45:49] [INFO ] Invariant cache hit.
[2023-03-09 23:45:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:45:53] [INFO ] Implicit Places using invariants and state equation in 4213 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
[2023-03-09 23:45:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:45:53] [INFO ] Invariant cache hit.
[2023-03-09 23:45:53] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4981 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 1 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 23 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 23:45:53] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 23:45:54] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-09 23:45:54] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 23:45:54] [INFO ] After 225ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:45:54] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:54] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-09 23:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 23:45:54] [INFO ] After 186ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:54] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-09 23:45:54] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 23:45:54] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:54] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:54] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-09 23:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-09 23:45:54] [INFO ] After 171ms 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 23:45:55] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1424 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 918 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 18 ms. (steps per millisecond=112 )
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 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538554 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538554 steps, saw 269338 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:45:58] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:45:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:45:58] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:45:58] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:45:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:45:58] [INFO ] After 28ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:45:58] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:58] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:45:58] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 23:45:58] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:58] [INFO ] After 44ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:58] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2023-03-09 23:45:59] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-09 23:45:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2023-03-09 23:45:59] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 23:45:59] [INFO ] After 662ms 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 25 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 25 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1456 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 923 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618332 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618332 steps, saw 309237 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 23:46:02] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:46:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:46:02] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:46:02] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:02] [INFO ] After 75ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:02] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:02] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:46:02] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 23:46:02] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:03] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:03] [INFO ] After 74ms 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 23:46:03] [INFO ] After 420ms 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 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 23:46:03] [INFO ] Invariant cache hit.
[2023-03-09 23:46:03] [INFO ] Implicit Places using invariants in 407 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 409 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 23:46:03] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:46:03] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-09 23:46:03] [INFO ] Invariant cache hit.
[2023-03-09 23:46:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:05] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1900 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 2325 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1438 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617428 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617428 steps, saw 308785 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:46:08] [INFO ] Invariant cache hit.
[2023-03-09 23:46:08] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:46:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:08] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:08] [INFO ] After 164ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:08] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 23:46:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:08] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:09] [INFO ] After 168ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:09] [INFO ] After 192ms 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 23:46:09] [INFO ] After 447ms 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 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 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:46:09] [INFO ] Invariant cache hit.
[2023-03-09 23:46:09] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-09 23:46:09] [INFO ] Invariant cache hit.
[2023-03-09 23:46:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:10] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-09 23:46:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:46:10] [INFO ] Invariant cache hit.
[2023-03-09 23:46:10] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 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 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 23:46:11] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:46:11] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:46:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:11] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:46:11] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:11] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:11] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:46:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:11] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:11] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:11] [INFO ] After 25ms 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 23:46:11] [INFO ] After 222ms 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627578 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627578 steps, saw 313860 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 23:46:14] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:46:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:46:14] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:46:14] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:46:14] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:14] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:46:15] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:15] [INFO ] After 52ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:15] [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 17 ms.
[2023-03-09 23:46:15] [INFO ] After 368ms 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.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 17 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 17 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1434 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 648059 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 648059 steps, saw 324099 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 23:46:18] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:46:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:46:18] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 23:46:18] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:18] [INFO ] After 31ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:18] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:18] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 27 ms returned sat
[2023-03-09 23:46:18] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:18] [INFO ] After 37ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:18] [INFO ] After 57ms 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 23:46:18] [INFO ] After 298ms 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 23:46:18] [INFO ] Invariant cache hit.
[2023-03-09 23:46:19] [INFO ] Implicit Places using invariants in 403 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 404 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 13 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 23:46:19] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 23:46:19] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-09 23:46:19] [INFO ] Invariant cache hit.
[2023-03-09 23:46:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:21] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2492 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 2914 ms. Remains : 209/227 places, 214/220 transitions.
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 10001 steps, including 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 658779 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 658779 steps, saw 329463 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:46:24] [INFO ] Invariant cache hit.
[2023-03-09 23:46:24] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 23:46:24] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:24] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:25] [INFO ] After 169ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:25] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 23:46:25] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:46:25] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:25] [INFO ] After 212ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:25] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-03-09 23:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 23:46:25] [INFO ] After 413ms 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 23:46:25] [INFO ] After 675ms 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 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 7 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 7 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 23:46:25] [INFO ] Invariant cache hit.
[2023-03-09 23:46:26] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-09 23:46:26] [INFO ] Invariant cache hit.
[2023-03-09 23:46:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:27] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-03-09 23:46:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:46:27] [INFO ] Invariant cache hit.
[2023-03-09 23:46:28] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2288 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 23:46:28] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 23:46:28] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 23:46:28] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:46:28] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:46:28] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:28] [INFO ] After 34ms 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 23:46:28] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1434 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 925 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 628630 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 628630 steps, saw 314386 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 23:46:31] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:46:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:46:31] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:46:31] [INFO ] After 192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:46:31] [INFO ] After 35ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:31] [INFO ] After 57ms 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 23:46:31] [INFO ] After 352ms 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 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 14 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1466 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 610248 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610248 steps, saw 305189 distinct states, run finished after 3004 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:46:34] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 23:46:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:46:34] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:46:35] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:35] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:35] [INFO ] After 67ms 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 23:46:35] [INFO ] After 341ms 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 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 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 23:46:35] [INFO ] Invariant cache hit.
[2023-03-09 23:46:35] [INFO ] Implicit Places using invariants in 416 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 418 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 8 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 23:46:35] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 23:46:35] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-09 23:46:35] [INFO ] Invariant cache hit.
[2023-03-09 23:46:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:37] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2001 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 2434 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1442 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 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621313 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621313 steps, saw 310731 distinct states, run finished after 3005 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:46:40] [INFO ] Invariant cache hit.
[2023-03-09 23:46:40] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-09 23:46:40] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:40] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:40] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:40] [INFO ] After 116ms 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 23:46:40] [INFO ] After 372ms 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 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 23:46:40] [INFO ] Invariant cache hit.
[2023-03-09 23:46:41] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-09 23:46:41] [INFO ] Invariant cache hit.
[2023-03-09 23:46:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:43] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
[2023-03-09 23:46:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:46:43] [INFO ] Invariant cache hit.
[2023-03-09 23:46:44] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3104 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 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 13 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 23:46:44] [INFO ] Computed 32 place invariants in 13 ms
[2023-03-09 23:46:44] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 23:46:44] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:46:44] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:46:44] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:46:44] [INFO ] After 33ms 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 23:46:44] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622444 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622444 steps, saw 311293 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 23:46:47] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:46:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:47] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 16 ms returned sat
[2023-03-09 23:46:47] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:46:47] [INFO ] After 60ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:47] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:47] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:46:47] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:48] [INFO ] After 55ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:48] [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 15 ms.
[2023-03-09 23:46:48] [INFO ] After 345ms 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 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 13 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1471 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 886 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654938 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654938 steps, saw 327540 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 23:46:51] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:46:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:51] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 23:46:51] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:51] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:51] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:46:51] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 33 ms returned sat
[2023-03-09 23:46:51] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:51] [INFO ] After 120ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:51] [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 23:46:51] [INFO ] After 490ms 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 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 23:46:51] [INFO ] Invariant cache hit.
[2023-03-09 23:46:52] [INFO ] Implicit Places using invariants in 401 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 402 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 10 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 23:46:52] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 23:46:52] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-09 23:46:52] [INFO ] Invariant cache hit.
[2023-03-09 23:46:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:54] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 1861 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 2279 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1444 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 894 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618134 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618134 steps, saw 309142 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:46:57] [INFO ] Invariant cache hit.
[2023-03-09 23:46:57] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:46:57] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:57] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:46:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:57] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:57] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:46:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:46:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:46:57] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:57] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:46:57] [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 13 ms.
[2023-03-09 23:46:57] [INFO ] After 311ms 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 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 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 23:46:57] [INFO ] Invariant cache hit.
[2023-03-09 23:46:58] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-09 23:46:58] [INFO ] Invariant cache hit.
[2023-03-09 23:46:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:46:59] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-09 23:46:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:46:59] [INFO ] Invariant cache hit.
[2023-03-09 23:47:00] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2265 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 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 23:47:00] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 23:47:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:00] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-09 23:47:00] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:47:00] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:00] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:00] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-09 23:47:00] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:00] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:00] [INFO ] After 24ms 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 23:47:00] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1416 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 906 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622062 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622062 steps, saw 311103 distinct states, run finished after 3006 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:47:03] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:47:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 23:47:03] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:03] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:47:04] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:47:04] [INFO ] After 69ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:04] [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 18 ms.
[2023-03-09 23:47:04] [INFO ] After 405ms 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.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 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1441 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 881 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634875 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634875 steps, saw 317509 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:47:07] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 23:47:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:07] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:47:07] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:07] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:47:07] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:07] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:07] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-09 23:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:47:07] [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 27 ms.
[2023-03-09 23:47:08] [INFO ] After 447ms 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 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 23:47:08] [INFO ] Invariant cache hit.
[2023-03-09 23:47:08] [INFO ] Implicit Places using invariants in 476 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 480 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 8 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 23:47:08] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:47:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 23:47:08] [INFO ] Invariant cache hit.
[2023-03-09 23:47:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:10] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 1741 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 2233 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1448 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 639378 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639378 steps, saw 319761 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:47:13] [INFO ] Invariant cache hit.
[2023-03-09 23:47:13] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:47:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:13] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:47:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:13] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:13] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:13] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-09 23:47:14] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-09 23:47:14] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-09 23:47:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2023-03-09 23:47:14] [INFO ] After 412ms 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 23:47:14] [INFO ] After 680ms 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 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 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:47:14] [INFO ] Invariant cache hit.
[2023-03-09 23:47:14] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-09 23:47:14] [INFO ] Invariant cache hit.
[2023-03-09 23:47:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:16] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-09 23:47:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:47:16] [INFO ] Invariant cache hit.
[2023-03-09 23:47:16] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2465 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 14 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 23:47:16] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:47:16] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:47:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:47:16] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:47:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:17] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:47:17] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-09 23:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 23:47:17] [INFO ] After 118ms 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 23:47:17] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1445 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 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617462 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617462 steps, saw 308802 distinct states, run finished after 3004 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:47:20] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:20] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:47:20] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:20] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:47:20] [INFO ] After 98ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:47:20] [INFO ] After 121ms 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 23:47:20] [INFO ] After 418ms 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 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 13 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 10001 steps, including 942 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648629 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648629 steps, saw 324388 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:47:23] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:47:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:23] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 23:47:23] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:23] [INFO ] After 33ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:47:23] [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 13 ms.
[2023-03-09 23:47:23] [INFO ] After 293ms 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 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 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:47:23] [INFO ] Invariant cache hit.
[2023-03-09 23:47:24] [INFO ] Implicit Places using invariants in 515 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 516 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 23:47:24] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:47:24] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-09 23:47:24] [INFO ] Invariant cache hit.
[2023-03-09 23:47:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:26] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2043 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 2572 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1430 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 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636739 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636739 steps, saw 318441 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:47:29] [INFO ] Invariant cache hit.
[2023-03-09 23:47:29] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:47:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:29] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:29] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:29] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 23:47:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:47:30] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:30] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:30] [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 11 ms.
[2023-03-09 23:47:30] [INFO ] After 278ms 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 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 23:47:30] [INFO ] Invariant cache hit.
[2023-03-09 23:47:30] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 23:47:30] [INFO ] Invariant cache hit.
[2023-03-09 23:47:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:32] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2023-03-09 23:47:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:47:32] [INFO ] Invariant cache hit.
[2023-03-09 23:47:32] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2343 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 15 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 23:47:32] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 23:47:32] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:47:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 23:47:32] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:47:32] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:32] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:47:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:32] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:32] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2023-03-09 23:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 23:47:32] [INFO ] After 114ms 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 23:47:32] [INFO ] After 307ms 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 616434 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 616434 steps, saw 308289 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:47:35] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:47:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:36] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:47:36] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:47:36] [INFO ] After 98ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:47:36] [INFO ] After 121ms 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 23:47:36] [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 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 1448 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 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649225 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649225 steps, saw 324686 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:47:39] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 23:47:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:39] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:47:39] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:39] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:39] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:39] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:47:39] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:39] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:39] [INFO ] After 90ms 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 23:47:39] [INFO ] After 307ms 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 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 23:47:39] [INFO ] Invariant cache hit.
[2023-03-09 23:47:40] [INFO ] Implicit Places using invariants in 485 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 487 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 9 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 23:47:40] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:47:40] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 23:47:40] [INFO ] Invariant cache hit.
[2023-03-09 23:47:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:42] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2042 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 2542 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1464 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 934 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643418 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643418 steps, saw 321781 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:47:45] [INFO ] Invariant cache hit.
[2023-03-09 23:47:45] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:47:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:47:45] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:45] [INFO ] After 49ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:47:45] [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 12 ms.
[2023-03-09 23:47:45] [INFO ] After 280ms 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 23:47:45] [INFO ] Invariant cache hit.
[2023-03-09 23:47:46] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 23:47:46] [INFO ] Invariant cache hit.
[2023-03-09 23:47:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:47] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2023-03-09 23:47:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:47:47] [INFO ] Invariant cache hit.
[2023-03-09 23:47:47] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1995 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 11 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 23:47:47] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:47:47] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:47:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:47:48] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:47:48] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:48] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:47:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:47:48] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:48] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:48] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-09 23:47:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 23:47:48] [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 10 ms.
[2023-03-09 23:47:48] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 10000 steps, including 945 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 607505 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607505 steps, saw 303818 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:47:51] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:47:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:47:51] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:47:51] [INFO ] After 211ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:47:51] [INFO ] After 43ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:51] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:51] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:47:52] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:52] [INFO ] After 56ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:52] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-09 23:47:52] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-09 23:47:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-09 23:47:52] [INFO ] After 293ms 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 23:47:52] [INFO ] After 599ms 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 16 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 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 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 640982 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640982 steps, saw 320565 distinct states, run finished after 3006 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:47:55] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 23:47:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:55] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 30 ms returned sat
[2023-03-09 23:47:55] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:47:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:55] [INFO ] After 207ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:55] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:47:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:47:55] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 21 ms returned sat
[2023-03-09 23:47:56] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:56] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:47:56] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 23:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 23:47:56] [INFO ] After 200ms 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 23:47:56] [INFO ] After 436ms 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 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 23:47:56] [INFO ] Invariant cache hit.
[2023-03-09 23:47:56] [INFO ] Implicit Places using invariants in 482 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 484 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 8 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 23:47:56] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:47:57] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-09 23:47:57] [INFO ] Invariant cache hit.
[2023-03-09 23:47:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:47:58] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1641 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 2137 ms. Remains : 206/226 places, 212/219 transitions.
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 10000 steps, including 893 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636399 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636399 steps, saw 318271 distinct states, run finished after 3003 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:48:01] [INFO ] Invariant cache hit.
[2023-03-09 23:48:01] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:48:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:01] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:01] [INFO ] After 64ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:01] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:48:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:02] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:02] [INFO ] After 66ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:02] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-09 23:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 23:48:02] [INFO ] After 179ms 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 23:48:02] [INFO ] After 442ms 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 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 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:48:02] [INFO ] Invariant cache hit.
[2023-03-09 23:48:02] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 23:48:02] [INFO ] Invariant cache hit.
[2023-03-09 23:48:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:04] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2023-03-09 23:48:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:48:04] [INFO ] Invariant cache hit.
[2023-03-09 23:48:04] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2041 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 13 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 23:48:04] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:48:04] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:48:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:48:04] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:48:04] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:48:04] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2023-03-09 23:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 23:48:04] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:04] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:48:04] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:48:04] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:04] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:04] [INFO ] After 31ms 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 23:48:04] [INFO ] After 277ms 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 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 639773 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639773 steps, saw 319960 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:48:07] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:48:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:08] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:48:08] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:48:08] [INFO ] After 51ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:08] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:48:08] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:48:08] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:08] [INFO ] After 58ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:08] [INFO ] After 82ms 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 23:48:08] [INFO ] After 382ms 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 18 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 18 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1464 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 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629627 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629627 steps, saw 314883 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 23:48:11] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:48:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:11] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 23:48:11] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:11] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:11] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 23:48:12] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:12] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:12] [INFO ] After 82ms 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 23:48:12] [INFO ] After 303ms 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 4 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 4 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 4 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 23:48:12] [INFO ] Invariant cache hit.
[2023-03-09 23:48:12] [INFO ] Implicit Places using invariants in 540 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 541 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 8 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 23:48:12] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 23:48:13] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 23:48:13] [INFO ] Invariant cache hit.
[2023-03-09 23:48:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:15] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 2142 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 2696 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1429 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 930 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636444 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636444 steps, saw 318297 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:48:18] [INFO ] Invariant cache hit.
[2023-03-09 23:48:18] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:48:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:18] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:18] [INFO ] After 36ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:18] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:48:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:18] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:18] [INFO ] After 48ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:18] [INFO ] After 67ms 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 23:48:18] [INFO ] After 280ms 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 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 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 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 23:48:18] [INFO ] Invariant cache hit.
[2023-03-09 23:48:18] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-09 23:48:18] [INFO ] Invariant cache hit.
[2023-03-09 23:48:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:20] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
[2023-03-09 23:48:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:48:20] [INFO ] Invariant cache hit.
[2023-03-09 23:48:21] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2485 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 14 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 23:48:21] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:48:21] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:48:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:21] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:48:21] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:21] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 23:48:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:21] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:21] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-09 23:48:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 439 ms
[2023-03-09 23:48:21] [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 10 ms.
[2023-03-09 23:48:21] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1407 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 950 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614269 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614269 steps, saw 307208 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 23:48:24] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:48:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:48:25] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:48:25] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:48:25] [INFO ] After 43ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:25] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:48:25] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:25] [INFO ] After 60ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:25] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2023-03-09 23:48:25] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2023-03-09 23:48:25] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2023-03-09 23:48:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2023-03-09 23:48:26] [INFO ] After 528ms 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 23:48:26] [INFO ] After 810ms 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 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 13 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 10000 steps, including 906 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626343 steps, run timeout after 3013 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 626343 steps, saw 313242 distinct states, run finished after 3013 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:48:29] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:48:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:29] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 23:48:29] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:29] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:29] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:29] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 23:48:29] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:29] [INFO ] After 142ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:29] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-09 23:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-09 23:48:29] [INFO ] After 286ms 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 23:48:29] [INFO ] After 541ms 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 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:48:29] [INFO ] Invariant cache hit.
[2023-03-09 23:48:30] [INFO ] Implicit Places using invariants in 503 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 505 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 17 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 23:48:30] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 23:48:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-09 23:48:30] [INFO ] Invariant cache hit.
[2023-03-09 23:48:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:32] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2336 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 2862 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1438 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 934 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645928 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645928 steps, saw 323039 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:48:35] [INFO ] Invariant cache hit.
[2023-03-09 23:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:48:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:36] [INFO ] After 190ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:36] [INFO ] After 52ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:36] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:48:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:48:36] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:36] [INFO ] After 63ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:36] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-09 23:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 23:48:36] [INFO ] After 187ms 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 23:48:36] [INFO ] After 458ms 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 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 23:48:36] [INFO ] Invariant cache hit.
[2023-03-09 23:48:36] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-09 23:48:36] [INFO ] Invariant cache hit.
[2023-03-09 23:48:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:38] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2023-03-09 23:48:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:48:38] [INFO ] Invariant cache hit.
[2023-03-09 23:48:38] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2303 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 23:48:38] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:48:38] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 23:48:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:39] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:48:39] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:48:39] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-09 23:48:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 23:48:39] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:39] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 23:48:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:48:39] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:39] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:39] [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 23:48:39] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1431 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 886 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614657 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614657 steps, saw 307403 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 23:48:42] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:48:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:48:42] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:48:42] [INFO ] After 65ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:42] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:48:42] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:48:43] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:43] [INFO ] After 44ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:43] [INFO ] After 67ms 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 23:48:43] [INFO ] After 331ms 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 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 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 14 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1464 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 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635732 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635732 steps, saw 317940 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:48:46] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:48:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:48:46] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 23:48:46] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:46] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:48:46] [INFO ] After 67ms 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 23:48:46] [INFO ] After 333ms 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 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 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 23:48:46] [INFO ] Invariant cache hit.
[2023-03-09 23:48:47] [INFO ] Implicit Places using invariants in 422 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 424 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 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 23:48:47] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 23:48:47] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 23:48:47] [INFO ] Invariant cache hit.
[2023-03-09 23:48:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:49] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2017 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 2457 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1432 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 911 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650619 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650619 steps, saw 325380 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:48:52] [INFO ] Invariant cache hit.
[2023-03-09 23:48:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:48:52] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-09 23:48:52] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:52] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:52] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:48:52] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-09 23:48:52] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:52] [INFO ] After 47ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:52] [INFO ] After 66ms 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 23:48:52] [INFO ] After 322ms 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 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 3 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 3 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 23:48:52] [INFO ] Invariant cache hit.
[2023-03-09 23:48:52] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 23:48:52] [INFO ] Invariant cache hit.
[2023-03-09 23:48:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:48:54] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
[2023-03-09 23:48:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:48:54] [INFO ] Invariant cache hit.
[2023-03-09 23:48:54] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1892 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 3 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 18 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 23:48:54] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 23:48:54] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 23:48:54] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:48:54] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:48:54] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:48:54] [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 11 ms.
[2023-03-09 23:48:54] [INFO ] After 250ms SMT Verify possible using all constraints in real 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 10001 steps, including 904 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619062 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619062 steps, saw 309603 distinct states, run finished after 3005 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:48:57] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 23:48:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:48:58] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:48:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:48:58] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:48:58] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:48:58] [INFO ] After 41ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:48:58] [INFO ] After 76ms 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 23:48:58] [INFO ] After 319ms 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.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 19 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 19 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 10000 steps, including 934 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625256 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625256 steps, saw 312699 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 23:49:01] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:49:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:49:01] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:49:01] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:01] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:01] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:49:01] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:49:02] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:02] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:02] [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 14 ms.
[2023-03-09 23:49:02] [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 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 23:49:02] [INFO ] Invariant cache hit.
[2023-03-09 23:49:02] [INFO ] Implicit Places using invariants in 525 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 526 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 23:49:02] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:49:03] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-09 23:49:03] [INFO ] Invariant cache hit.
[2023-03-09 23:49:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:04] [INFO ] Implicit Places using invariants and state equation in 1720 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 2589 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1458 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 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 633688 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633688 steps, saw 316916 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:49:07] [INFO ] Invariant cache hit.
[2023-03-09 23:49:07] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:49:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:49:08] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:49:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:49:08] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:08] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:08] [INFO ] After 201ms 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 23:49:08] [INFO ] After 420ms 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 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:49:08] [INFO ] Invariant cache hit.
[2023-03-09 23:49:08] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 23:49:08] [INFO ] Invariant cache hit.
[2023-03-09 23:49:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:10] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2023-03-09 23:49:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:49:10] [INFO ] Invariant cache hit.
[2023-03-09 23:49:10] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2117 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 15 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 23:49:10] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:49:10] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:49:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:49:10] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:49:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:49:10] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:49:10] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:10] [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 23:49:10] [INFO ] After 224ms 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620337 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620337 steps, saw 310239 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 23:49:14] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:49:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:14] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:49:14] [INFO ] After 225ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:49:14] [INFO ] After 65ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:14] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:49:14] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:14] [INFO ] After 230ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:15] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-09 23:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-09 23:49:15] [INFO ] After 369ms 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 23:49:15] [INFO ] After 688ms 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 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 1435 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 929 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648101 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 648101 steps, saw 324123 distinct states, run finished after 3004 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:49:18] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:49:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:49:18] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:49:18] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:18] [INFO ] After 86ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:18] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:18] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:49:18] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:18] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:18] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 0 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 1 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-09 23:49:19] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 0 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 0 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 1 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 0 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 1 ms to minimize.
[2023-03-09 23:49:20] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
[2023-03-09 23:49:21] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2023-03-09 23:49:21] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-09 23:49:21] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2023-03-09 23:49:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2553 ms
[2023-03-09 23:49:21] [INFO ] After 2741ms 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 23:49:21] [INFO ] After 2965ms 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 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 23:49:21] [INFO ] Invariant cache hit.
[2023-03-09 23:49:21] [INFO ] Implicit Places using invariants in 467 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 469 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 23:49:21] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 23:49:22] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-09 23:49:22] [INFO ] Invariant cache hit.
[2023-03-09 23:49:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:23] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1649 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 2129 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1454 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 934 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 637970 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 637970 steps, saw 319059 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:49:26] [INFO ] Invariant cache hit.
[2023-03-09 23:49:26] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:49:26] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:49:26] [INFO ] After 209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:27] [INFO ] After 171ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:27] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:49:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:49:27] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:27] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:27] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2023-03-09 23:49:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-09 23:49:27] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:49:27] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2023-03-09 23:49:28] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 1 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 0 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 0 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 1 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 1 ms to minimize.
[2023-03-09 23:49:29] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 1 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 0 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 0 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 0 ms to minimize.
[2023-03-09 23:49:30] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 1 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 1 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 0 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 0 ms to minimize.
[2023-03-09 23:49:31] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 0 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 0 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 1 ms to minimize.
[2023-03-09 23:49:32] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2023-03-09 23:49:33] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-03-09 23:49:33] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-09 23:49:33] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 5868 ms
[2023-03-09 23:49:33] [INFO ] After 6013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-09 23:49:33] [INFO ] After 6312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 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 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:49:33] [INFO ] Invariant cache hit.
[2023-03-09 23:49:33] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-09 23:49:33] [INFO ] Invariant cache hit.
[2023-03-09 23:49:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:34] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2023-03-09 23:49:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:49:34] [INFO ] Invariant cache hit.
[2023-03-09 23:49:35] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1863 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 13 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 23:49:35] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:49:35] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:49:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:49:35] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:49:35] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:35] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:49:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-09 23:49:35] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:35] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-09 23:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 23:49:35] [INFO ] After 111ms 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 23:49:35] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1458 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 899 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617024 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617024 steps, saw 308584 distinct states, run finished after 3006 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:49:38] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:49:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:38] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:49:39] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:49:39] [INFO ] After 65ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:39] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:39] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:49:39] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:39] [INFO ] After 204ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:39] [INFO ] After 249ms 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 23:49:39] [INFO ] After 580ms 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 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 22 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1424 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 876 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 570860 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570860 steps, saw 285497 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:49:42] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:49:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:49:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:49:43] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:43] [INFO ] After 129ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:43] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:43] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:49:43] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:43] [INFO ] After 91ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:43] [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 12 ms.
[2023-03-09 23:49:43] [INFO ] After 352ms 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 23:49:43] [INFO ] Invariant cache hit.
[2023-03-09 23:49:43] [INFO ] Implicit Places using invariants in 387 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 388 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 12 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 23:49:43] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 23:49:44] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 23:49:44] [INFO ] Invariant cache hit.
[2023-03-09 23:49:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:46] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2211 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 2616 ms. Remains : 209/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 10000 steps, including 902 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 655478 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 655478 steps, saw 327812 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:49:49] [INFO ] Invariant cache hit.
[2023-03-09 23:49:49] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-09 23:49:49] [INFO ] [Real]Absence check using 6 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 23:49:49] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:49] [INFO ] After 128ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:49] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:49:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-09 23:49:49] [INFO ] [Nat]Absence check using 6 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-09 23:49:49] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:50] [INFO ] After 124ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:49:50] [INFO ] After 155ms 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 23:49:50] [INFO ] After 501ms 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 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 23:49:50] [INFO ] Invariant cache hit.
[2023-03-09 23:49:50] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-09 23:49:50] [INFO ] Invariant cache hit.
[2023-03-09 23:49:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:49:53] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
[2023-03-09 23:49:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:49:53] [INFO ] Invariant cache hit.
[2023-03-09 23:49:53] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3871 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 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 23:49:53] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 23:49:54] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-09 23:49:54] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:49:54] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:49:54] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:49:54] [INFO ] After 40ms 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 23:49:54] [INFO ] After 341ms 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529293 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529293 steps, saw 264708 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:49:57] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:49:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:49:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 23:49:57] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:49:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:49:57] [INFO ] After 59ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:49:57] [INFO ] After 99ms 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 23:49:57] [INFO ] After 449ms 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 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 1406 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 894 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 603404 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603404 steps, saw 301768 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:50:00] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:50:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:00] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:50:01] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:01] [INFO ] After 110ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:01] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:50:01] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 23:50:01] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:01] [INFO ] After 156ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:01] [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 20 ms.
[2023-03-09 23:50:01] [INFO ] After 491ms 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 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 6 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 23:50:01] [INFO ] Invariant cache hit.
[2023-03-09 23:50:02] [INFO ] Implicit Places using invariants in 531 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 532 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 23:50:02] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 23:50:02] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-09 23:50:02] [INFO ] Invariant cache hit.
[2023-03-09 23:50:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:04] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2264 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 2816 ms. Remains : 212/229 places, 216/222 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 10001 steps, including 920 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518290 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518290 steps, saw 259196 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:50:07] [INFO ] Invariant cache hit.
[2023-03-09 23:50:07] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 23:50:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 23:50:07] [INFO ] After 237ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:07] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:07] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-09 23:50:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-09 23:50:08] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:08] [INFO ] After 241ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:08] [INFO ] After 272ms 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 23:50:08] [INFO ] After 687ms 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 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 5 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 6 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 5 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 23:50:08] [INFO ] Invariant cache hit.
[2023-03-09 23:50:08] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-09 23:50:08] [INFO ] Invariant cache hit.
[2023-03-09 23:50:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:11] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 2685 ms to find 0 implicit places.
[2023-03-09 23:50:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:50:11] [INFO ] Invariant cache hit.
[2023-03-09 23:50:11] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2942 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 19 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 23:50:11] [INFO ] Computed 33 place invariants in 19 ms
[2023-03-09 23:50:11] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 23:50:11] [INFO ] [Real]Absence check using 6 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-09 23:50:11] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:50:11] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:11] [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 23:50:11] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 10000 steps, including 899 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 577722 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577722 steps, saw 288922 distinct states, run finished after 3004 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:50:14] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:50:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:15] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:50:15] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:50:15] [INFO ] After 59ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:15] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:50:15] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:50:15] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:15] [INFO ] After 157ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:16] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-09 23:50:16] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:50:16] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2023-03-09 23:50:16] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-09 23:50:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
[2023-03-09 23:50:16] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 23:50:16] [INFO ] After 1305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 1453 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 972 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 539861 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 539861 steps, saw 269993 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:50:19] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 23:50:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:50:19] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-09 23:50:20] [INFO ] After 219ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:20] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:20] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:50:20] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 23:50:20] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:20] [INFO ] After 76ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:20] [INFO ] After 111ms 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 23:50:20] [INFO ] After 467ms 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 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 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 23:50:20] [INFO ] Invariant cache hit.
[2023-03-09 23:50:21] [INFO ] Implicit Places using invariants in 619 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 630 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 23:50:21] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 23:50:21] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-09 23:50:21] [INFO ] Invariant cache hit.
[2023-03-09 23:50:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:23] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2748 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 3397 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1464 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 899 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 546000 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 546000 steps, saw 273065 distinct states, run finished after 3005 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:50:27] [INFO ] Invariant cache hit.
[2023-03-09 23:50:27] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:50:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:50:27] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:27] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:27] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:50:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:50:27] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:27] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:27] [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 24 ms.
[2023-03-09 23:50:27] [INFO ] After 458ms 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 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:50:27] [INFO ] Invariant cache hit.
[2023-03-09 23:50:28] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-09 23:50:28] [INFO ] Invariant cache hit.
[2023-03-09 23:50:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:30] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2023-03-09 23:50:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:50:30] [INFO ] Invariant cache hit.
[2023-03-09 23:50:30] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2835 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 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 23:50:30] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 23:50:30] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:50:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:50:30] [INFO ] After 186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:50:30] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:31] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-09 23:50:31] [INFO ] After 192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:31] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:50:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:50:31] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:31] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:31] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-09 23:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-09 23:50:31] [INFO ] After 172ms 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 23:50:31] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1414 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 919 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 562730 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 562730 steps, saw 281424 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:50:34] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 23:50:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:50:35] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:50:35] [INFO ] After 86ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:35] [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 18 ms.
[2023-03-09 23:50:35] [INFO ] After 463ms 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 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 17 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 17 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1434 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 927 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 587331 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587331 steps, saw 293726 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:50:38] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:50:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:50:38] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 36 ms returned sat
[2023-03-09 23:50:38] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:38] [INFO ] After 105ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:38] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:38] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 36 ms returned sat
[2023-03-09 23:50:38] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:39] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:39] [INFO ] After 114ms 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 23:50:39] [INFO ] After 448ms 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 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 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:50:39] [INFO ] Invariant cache hit.
[2023-03-09 23:50:39] [INFO ] Implicit Places using invariants in 527 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 533 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 17 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 23:50:39] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 23:50:40] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 23:50:40] [INFO ] Invariant cache hit.
[2023-03-09 23:50:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:42] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 3186 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 3743 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1453 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 947 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 570441 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570441 steps, saw 285288 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:50:45] [INFO ] Invariant cache hit.
[2023-03-09 23:50:45] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2023-03-09 23:50:45] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:50:46] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:46] [INFO ] After 141ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:46] [INFO ] After 172ms 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 23:50:46] [INFO ] After 521ms 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 5 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 5 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 23:50:46] [INFO ] Invariant cache hit.
[2023-03-09 23:50:46] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-09 23:50:46] [INFO ] Invariant cache hit.
[2023-03-09 23:50:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:49] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2023-03-09 23:50:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:50:49] [INFO ] Invariant cache hit.
[2023-03-09 23:50:49] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3220 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 18 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 23:50:49] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 23:50:49] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 23:50:49] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:50:49] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:50:49] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:50] [INFO ] After 38ms 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 23:50:50] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 956 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575738 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575738 steps, saw 287930 distinct states, run finished after 3006 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:50:53] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:50:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:50:53] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:50:53] [INFO ] After 45ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:53] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:53] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:53] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:50:53] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:53] [INFO ] After 51ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:53] [INFO ] After 73ms 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 23:50:53] [INFO ] After 337ms 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.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 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 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 1424 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 907 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620189 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620189 steps, saw 310166 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 23:50:56] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:50:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:50:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:50:57] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:50:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:50:57] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:50:57] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:57] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:50:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:50:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:50:57] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:57] [INFO ] After 81ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:50:57] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2023-03-09 23:50:57] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-09 23:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-09 23:50:57] [INFO ] After 437ms 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 23:50:57] [INFO ] After 695ms 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 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 23:50:57] [INFO ] Invariant cache hit.
[2023-03-09 23:50:58] [INFO ] Implicit Places using invariants in 670 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 681 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 12 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 23:50:58] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 23:50:58] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-09 23:50:58] [INFO ] Invariant cache hit.
[2023-03-09 23:50:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:01] [INFO ] Implicit Places using invariants and state equation in 2481 ms returned []
Implicit Place search using SMT with State Equation took 2870 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 3570 ms. Remains : 207/226 places, 213/219 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 10000 steps, including 914 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623428 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623428 steps, saw 311786 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:51:04] [INFO ] Invariant cache hit.
[2023-03-09 23:51:04] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-09 23:51:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:51:04] [INFO ] After 257ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:04] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:04] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-09 23:51:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:51:05] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:05] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:05] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 0 ms to minimize.
[2023-03-09 23:51:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-09 23:51:05] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 23:51:05] [INFO ] After 877ms 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 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 7 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 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 23:51:05] [INFO ] Invariant cache hit.
[2023-03-09 23:51:06] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-09 23:51:06] [INFO ] Invariant cache hit.
[2023-03-09 23:51:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:09] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 3395 ms to find 0 implicit places.
[2023-03-09 23:51:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:51:09] [INFO ] Invariant cache hit.
[2023-03-09 23:51:09] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3669 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 0 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 20 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 23:51:09] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 23:51:09] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:51:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:51:09] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:51:09] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:51:09] [INFO ] After 39ms 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 23:51:09] [INFO ] After 323ms 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 19 ms. (steps per millisecond=106 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 19 ms. (steps per millisecond=106 ) properties seen :1
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 10000 steps, including 911 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 587266 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587266 steps, saw 293693 distinct states, run finished after 3003 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:51:12] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:51:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:51:13] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:51:13] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:13] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 23:51:13] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:51:13] [INFO ] After 47ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:13] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-09 23:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 23:51:13] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 23:51:13] [INFO ] After 602ms 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 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 22 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1474 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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 567949 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567949 steps, saw 284035 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:51:17] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 23:51:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:17] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 23:51:17] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:17] [INFO ] After 119ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:17] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:17] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 38 ms returned sat
[2023-03-09 23:51:17] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:17] [INFO ] After 213ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:18] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2023-03-09 23:51:18] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-09 23:51:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2023-03-09 23:51:18] [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 22 ms.
[2023-03-09 23:51:18] [INFO ] After 989ms 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 23:51:18] [INFO ] Invariant cache hit.
[2023-03-09 23:51:19] [INFO ] Implicit Places using invariants in 586 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 593 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 23:51:19] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 23:51:19] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-09 23:51:19] [INFO ] Invariant cache hit.
[2023-03-09 23:51:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:22] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 3149 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 3761 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1463 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 922 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 586258 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 586258 steps, saw 293191 distinct states, run finished after 3004 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:51:25] [INFO ] Invariant cache hit.
[2023-03-09 23:51:25] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 23:51:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:51:25] [INFO ] After 228ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:25] [INFO ] After 122ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:25] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 23:51:25] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:51:26] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:26] [INFO ] After 156ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:26] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-09 23:51:26] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-09 23:51:26] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-09 23:51:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2023-03-09 23:51:26] [INFO ] After 663ms 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 23:51:26] [INFO ] After 1042ms 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 23:51:26] [INFO ] Invariant cache hit.
[2023-03-09 23:51:27] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-09 23:51:27] [INFO ] Invariant cache hit.
[2023-03-09 23:51:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:29] [INFO ] Implicit Places using invariants and state equation in 2852 ms returned []
Implicit Place search using SMT with State Equation took 3254 ms to find 0 implicit places.
[2023-03-09 23:51:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:51:29] [INFO ] Invariant cache hit.
[2023-03-09 23:51:30] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3604 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 23 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 23:51:30] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 23:51:30] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:51:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 23:51:30] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:51:30] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:51:30] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-09 23:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 23:51:30] [INFO ] After 173ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:30] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 23:51:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:51:31] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:31] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:31] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2023-03-09 23:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-09 23:51:31] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 23:51:31] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1423 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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614252 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614252 steps, saw 307199 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 23:51:34] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:51:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:51:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 23:51:34] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:51:34] [INFO ] After 103ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:34] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:34] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:51:35] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:35] [INFO ] After 150ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:35] [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 20 ms.
[2023-03-09 23:51:35] [INFO ] After 522ms 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 23 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 25 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1468 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 892 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636803 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636803 steps, saw 318472 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:51:38] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:51:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:51:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 23:51:38] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:38] [INFO ] After 68ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:38] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:38] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 23:51:39] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:39] [INFO ] After 135ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:39] [INFO ] After 165ms 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 23:51:39] [INFO ] After 490ms 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 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 23:51:39] [INFO ] Invariant cache hit.
[2023-03-09 23:51:39] [INFO ] Implicit Places using invariants in 607 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 609 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 23:51:39] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 23:51:40] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-09 23:51:40] [INFO ] Invariant cache hit.
[2023-03-09 23:51:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:42] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 2727 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 3357 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1443 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 925 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623573 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623573 steps, saw 311859 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:51:45] [INFO ] Invariant cache hit.
[2023-03-09 23:51:45] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:51:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:51:45] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:46] [INFO ] After 234ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:46] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 23:51:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:51:46] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:46] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:46] [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 16 ms.
[2023-03-09 23:51:46] [INFO ] After 449ms 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 23:51:46] [INFO ] Invariant cache hit.
[2023-03-09 23:51:46] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-09 23:51:46] [INFO ] Invariant cache hit.
[2023-03-09 23:51:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:48] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-09 23:51:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:51:48] [INFO ] Invariant cache hit.
[2023-03-09 23:51:49] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2387 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 21 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 23:51:49] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:51:49] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:51:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:51:49] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:51:49] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:51:49] [INFO ] After 31ms 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 23:51:49] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1413 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 915 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 513945 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 513945 steps, saw 257025 distinct states, run finished after 3006 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:51:52] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:51:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:52] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:51:52] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:51:52] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 23:51:52] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:51:52] [INFO ] After 84ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:52] [INFO ] After 106ms 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 23:51:52] [INFO ] After 369ms 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 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 1416 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 936 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652894 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652894 steps, saw 326518 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:51:56] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:51:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:51:56] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 23:51:56] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:51:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:56] [INFO ] After 225ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:56] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:51:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:51:56] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 23:51:56] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:56] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:51:56] [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 13 ms.
[2023-03-09 23:51:56] [INFO ] After 440ms 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 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 23:51:56] [INFO ] Invariant cache hit.
[2023-03-09 23:51:57] [INFO ] Implicit Places using invariants in 503 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 519 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 8 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 23:51:57] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:51:57] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 23:51:57] [INFO ] Invariant cache hit.
[2023-03-09 23:51:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:51:59] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2071 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 2603 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1447 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 930 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649193 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649193 steps, saw 324670 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:52:02] [INFO ] Invariant cache hit.
[2023-03-09 23:52:02] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:52:02] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:02] [INFO ] After 187ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:02] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:03] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:52:03] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:03] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:03] [INFO ] After 73ms 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 23:52:03] [INFO ] After 346ms 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 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 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:52:03] [INFO ] Invariant cache hit.
[2023-03-09 23:52:03] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 23:52:03] [INFO ] Invariant cache hit.
[2023-03-09 23:52:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:05] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
[2023-03-09 23:52:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:52:05] [INFO ] Invariant cache hit.
[2023-03-09 23:52:05] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2635 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 14 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 23:52:05] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:52:06] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 23:52:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:52:06] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:52:06] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:52:06] [INFO ] After 29ms 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 23:52:06] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1448 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 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598522 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598522 steps, saw 299322 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 23:52:09] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:52:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:52:09] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:52:09] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:52:09] [INFO ] After 56ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:09] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:52:09] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:52:09] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:09] [INFO ] After 49ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:09] [INFO ] After 70ms 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 23:52:09] [INFO ] After 324ms 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 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 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 1416 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 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 637007 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 637007 steps, saw 318578 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:52:12] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:52:13] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-09 23:52:13] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 20 ms returned sat
[2023-03-09 23:52:13] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-09 23:52:13] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 21 ms returned sat
[2023-03-09 23:52:13] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:13] [INFO ] After 150ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:13] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-09 23:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 23:52:13] [INFO ] After 290ms 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 23:52:13] [INFO ] After 579ms 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 23:52:13] [INFO ] Invariant cache hit.
[2023-03-09 23:52:14] [INFO ] Implicit Places using invariants in 415 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 416 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 10 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 23:52:14] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:52:14] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 23:52:14] [INFO ] Invariant cache hit.
[2023-03-09 23:52:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:16] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2034 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 2464 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1444 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 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 633212 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633212 steps, saw 316681 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:52:19] [INFO ] Invariant cache hit.
[2023-03-09 23:52:19] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 23:52:19] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:52:19] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:19] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:19] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 23:52:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:52:19] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:19] [INFO ] After 135ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:20] [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 13 ms.
[2023-03-09 23:52:20] [INFO ] After 455ms 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 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 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 23:52:20] [INFO ] Invariant cache hit.
[2023-03-09 23:52:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-09 23:52:20] [INFO ] Invariant cache hit.
[2023-03-09 23:52:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:22] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
[2023-03-09 23:52:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:52:22] [INFO ] Invariant cache hit.
[2023-03-09 23:52:22] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 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 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 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 23:52:22] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:52:22] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 23:52:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:52:22] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:52:22] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:22] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 23:52:23] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:52:23] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:23] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:23] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-09 23:52:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-09 23:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-03-09 23:52:23] [INFO ] After 265ms 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 23:52:23] [INFO ] After 581ms 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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608084 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608084 steps, saw 304107 distinct states, run finished after 3004 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:52:26] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:52:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:52:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:52:26] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:52:26] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:52:27] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:52:27] [INFO ] After 179ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:27] [INFO ] After 202ms 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 23:52:27] [INFO ] After 471ms 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.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 1424 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649779 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649779 steps, saw 324960 distinct states, run finished after 3005 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:52:30] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:52:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:52:30] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 23:52:30] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:30] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:30] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:52:30] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-09 23:52:31] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:31] [INFO ] After 130ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:31] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-09 23:52:31] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-09 23:52:31] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-09 23:52:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2023-03-09 23:52:31] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 23:52:31] [INFO ] After 973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 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 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 23:52:31] [INFO ] Invariant cache hit.
[2023-03-09 23:52:32] [INFO ] Implicit Places using invariants in 648 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 664 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 23:52:32] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 23:52:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-09 23:52:32] [INFO ] Invariant cache hit.
[2023-03-09 23:52:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:34] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1728 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 2409 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1434 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 928 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614868 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614868 steps, saw 307507 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:52:37] [INFO ] Invariant cache hit.
[2023-03-09 23:52:37] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 23:52:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:52:37] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:52:37] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:37] [INFO ] After 103ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:37] [INFO ] After 135ms 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 23:52:38] [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 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 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 23:52:38] [INFO ] Invariant cache hit.
[2023-03-09 23:52:38] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-09 23:52:38] [INFO ] Invariant cache hit.
[2023-03-09 23:52:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:40] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2023-03-09 23:52:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:52:40] [INFO ] Invariant cache hit.
[2023-03-09 23:52:40] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2820 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 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 23:52:40] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 23:52:40] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:52:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:52:41] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:52:41] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:52:41] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:52:41] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:41] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 23:52:41] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1463 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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 557010 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557010 steps, saw 278566 distinct states, run finished after 3004 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:52:44] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 23:52:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:52:44] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 23:52:44] [INFO ] After 188ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:52:45] [INFO ] After 136ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:52:45] [INFO ] After 172ms 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 23:52:45] [INFO ] After 486ms 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 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 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 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 916 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575082 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575082 steps, saw 287604 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:52:48] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-09 23:52:48] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:48] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 22 ms returned sat
[2023-03-09 23:52:48] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-09 23:52:48] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 22 ms returned sat
[2023-03-09 23:52:48] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:49] [INFO ] After 235ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:49] [INFO ] After 266ms 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 23:52:49] [INFO ] After 634ms 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 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:52:49] [INFO ] Invariant cache hit.
[2023-03-09 23:52:49] [INFO ] Implicit Places using invariants in 697 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 699 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 12 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 23:52:49] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 23:52:50] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-09 23:52:50] [INFO ] Invariant cache hit.
[2023-03-09 23:52:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:52] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 2632 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 3351 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639747 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639747 steps, saw 319947 distinct states, run finished after 3002 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:52:55] [INFO ] Invariant cache hit.
[2023-03-09 23:52:55] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:52:55] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:55] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:55] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:52:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 23:52:56] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:56] [INFO ] After 64ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:56] [INFO ] After 93ms 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 23:52:56] [INFO ] After 388ms 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 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 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 23:52:56] [INFO ] Invariant cache hit.
[2023-03-09 23:52:56] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 23:52:56] [INFO ] Invariant cache hit.
[2023-03-09 23:52:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:52:58] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
[2023-03-09 23:52:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:52:58] [INFO ] Invariant cache hit.
[2023-03-09 23:52:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2818 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 0 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 16 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 23:52:59] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:52:59] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-09 23:52:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:52:59] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:52:59] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 23:52:59] [INFO ] After 122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:59] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:52:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:52:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:52:59] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:59] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-09 23:52:59] [INFO ] After 263ms 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 23:52:59] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1458 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 895 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 548856 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 548856 steps, saw 274490 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:53:02] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 23:53:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:53:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 27 ms returned sat
[2023-03-09 23:53:03] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:53:03] [INFO ] After 255ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:03] [INFO ] After 298ms 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 23:53:03] [INFO ] After 627ms SMT Verify possible using all constraints in real 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.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 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 1446 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 884 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 581210 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581210 steps, saw 290670 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:53:06] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 23:53:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:53:06] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 40 ms returned sat
[2023-03-09 23:53:06] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:07] [INFO ] After 88ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:07] [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 20 ms.
[2023-03-09 23:53:07] [INFO ] After 442ms SMT Verify possible using all constraints in real 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 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 23:53:07] [INFO ] Invariant cache hit.
[2023-03-09 23:53:07] [INFO ] Implicit Places using invariants in 662 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 664 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 23:53:07] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 23:53:08] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-09 23:53:08] [INFO ] Invariant cache hit.
[2023-03-09 23:53:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:11] [INFO ] Implicit Places using invariants and state equation in 2834 ms returned []
Implicit Place search using SMT with State Equation took 3221 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 3903 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1432 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 899 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568225 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568225 steps, saw 284178 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:53:14] [INFO ] Invariant cache hit.
[2023-03-09 23:53:14] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 23:53:14] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:53:14] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:14] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:14] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-09 23:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-09 23:53:14] [INFO ] After 249ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:14] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 23:53:14] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:53:14] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:15] [INFO ] After 164ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:15] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-03-09 23:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-09 23:53:15] [INFO ] After 337ms 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 23:53:15] [INFO ] After 686ms 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 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 7 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 23:53:15] [INFO ] Invariant cache hit.
[2023-03-09 23:53:15] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-09 23:53:15] [INFO ] Invariant cache hit.
[2023-03-09 23:53:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:18] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
[2023-03-09 23:53:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:53:18] [INFO ] Invariant cache hit.
[2023-03-09 23:53:18] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3392 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 23:53:18] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 23:53:18] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:53:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 23:53:18] [INFO ] After 179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:53:19] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:19] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:53:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:53:19] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:19] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:19] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 23:53:19] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1428 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 892 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593680 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593680 steps, saw 296904 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:53:22] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:53:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:53:22] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:53:22] [INFO ] After 235ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:53:22] [INFO ] After 71ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:22] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-03-09 23:53:23] [INFO ] After 353ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:23] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:53:23] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:53:23] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:23] [INFO ] After 99ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 697 ms
[2023-03-09 23:53:24] [INFO ] After 816ms 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 23:53:24] [INFO ] After 1290ms 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 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 23 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 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 921 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596737 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596737 steps, saw 298428 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:53:27] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:53:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:53:27] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 23:53:27] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:27] [INFO ] After 96ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:27] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:53:27] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 23:53:28] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:28] [INFO ] After 126ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:28] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-09 23:53:28] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2023-03-09 23:53:28] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 0 ms to minimize.
[2023-03-09 23:53:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2023-03-09 23:53:28] [INFO ] After 581ms 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 23:53:28] [INFO ] After 926ms 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 23:53:28] [INFO ] Invariant cache hit.
[2023-03-09 23:53:29] [INFO ] Implicit Places using invariants in 674 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 676 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 23:53:29] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 23:53:29] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-09 23:53:29] [INFO ] Invariant cache hit.
[2023-03-09 23:53:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:31] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1864 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 2560 ms. Remains : 206/226 places, 212/219 transitions.
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 893 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 604345 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604345 steps, saw 302236 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:53:34] [INFO ] Invariant cache hit.
[2023-03-09 23:53:34] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 23:53:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:53:34] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:34] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:34] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:53:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:53:35] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:35] [INFO ] After 224ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:35] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2023-03-09 23:53:35] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-09 23:53:35] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:53:35] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2023-03-09 23:53:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 552 ms
[2023-03-09 23:53:35] [INFO ] After 796ms 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 23:53:35] [INFO ] After 1092ms 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 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:53:35] [INFO ] Invariant cache hit.
[2023-03-09 23:53:36] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 23:53:36] [INFO ] Invariant cache hit.
[2023-03-09 23:53:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:38] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2023-03-09 23:53:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:53:38] [INFO ] Invariant cache hit.
[2023-03-09 23:53:39] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3141 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 20 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 23:53:39] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 23:53:39] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 23:53:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:53:39] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:53:39] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:39] [INFO ] After 40ms 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 23:53:39] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 898 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 533751 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533751 steps, saw 266937 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:53:42] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 23:53:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:53:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 16 ms returned sat
[2023-03-09 23:53:42] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:53:42] [INFO ] After 106ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:42] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:53:42] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:53:43] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:43] [INFO ] After 194ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:43] [INFO ] After 230ms 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 23:53:43] [INFO ] After 564ms 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 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 25 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 25 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1453 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 579333 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 579333 steps, saw 289730 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 23:53:46] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:53:46] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-09 23:53:46] [INFO ] [Real]Absence check using 6 positive and 38 generalized place invariants in 34 ms returned sat
[2023-03-09 23:53:46] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:46] [INFO ] After 47ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:46] [INFO ] After 68ms 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 23:53:46] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 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 3 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 3 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 4 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 23:53:46] [INFO ] Invariant cache hit.
[2023-03-09 23:53:47] [INFO ] Implicit Places using invariants in 696 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 698 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 11 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 23:53:47] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 23:53:47] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-09 23:53:47] [INFO ] Invariant cache hit.
[2023-03-09 23:53:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:49] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2416 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 3129 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1430 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 905 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622877 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622877 steps, saw 311513 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:53:52] [INFO ] Invariant cache hit.
[2023-03-09 23:53:53] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2023-03-09 23:53:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:53:53] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:53] [INFO ] After 62ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:53] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-09 23:53:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:53:53] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:53] [INFO ] After 237ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:53] [INFO ] After 270ms 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 23:53:53] [INFO ] After 575ms 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 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 23:53:53] [INFO ] Invariant cache hit.
[2023-03-09 23:53:54] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 23:53:54] [INFO ] Invariant cache hit.
[2023-03-09 23:53:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:53:56] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2023-03-09 23:53:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:53:56] [INFO ] Invariant cache hit.
[2023-03-09 23:53:56] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3094 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 21 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 23:53:56] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 23:53:57] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-09 23:53:57] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 23:53:57] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:53:57] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:53:57] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:57] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:53:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-09 23:53:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 23:53:57] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:57] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:53:57] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-09 23:53:57] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-09 23:53:57] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-09 23:53:58] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2023-03-09 23:53:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-09 23:53:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 527 ms
[2023-03-09 23:53:58] [INFO ] After 555ms 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 23:53:58] [INFO ] After 865ms 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 930 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 573025 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 573025 steps, saw 286573 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:54:01] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:54:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:54:01] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 23:54:01] [INFO ] After 264ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:54:01] [INFO ] After 61ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:54:01] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-09 23:54:01] [INFO ] After 219ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:01] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:01] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 23:54:02] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:02] [INFO ] After 77ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:02] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-09 23:54:02] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-09 23:54:02] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-09 23:54:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2023-03-09 23:54:02] [INFO ] After 505ms 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 23:54:02] [INFO ] After 926ms 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.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 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 22 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1451 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 930 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 553061 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553061 steps, saw 276590 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:54:05] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 23:54:05] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-09 23:54:05] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-09 23:54:06] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:06] [INFO ] After 135ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:06] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-09 23:54:06] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 19 ms returned sat
[2023-03-09 23:54:06] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:06] [INFO ] After 190ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:06] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-03-09 23:54:07] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-09 23:54:07] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2023-03-09 23:54:07] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-09 23:54:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2023-03-09 23:54:07] [INFO ] After 836ms 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 23:54:07] [INFO ] After 1164ms 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 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 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:54:07] [INFO ] Invariant cache hit.
[2023-03-09 23:54:08] [INFO ] Implicit Places using invariants in 710 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 713 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 19 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 23:54:08] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 23:54:08] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 23:54:08] [INFO ] Invariant cache hit.
[2023-03-09 23:54:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:10] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2708 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 3448 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1428 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 913 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609014 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 609014 steps, saw 304577 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:54:13] [INFO ] Invariant cache hit.
[2023-03-09 23:54:13] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:54:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:54:14] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:14] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:14] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:54:14] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:54:14] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:14] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:14] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-09 23:54:14] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-09 23:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-09 23:54:14] [INFO ] After 299ms 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 23:54:14] [INFO ] After 553ms 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 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 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 23:54:14] [INFO ] Invariant cache hit.
[2023-03-09 23:54:15] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-09 23:54:15] [INFO ] Invariant cache hit.
[2023-03-09 23:54:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:16] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-03-09 23:54:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:54:16] [INFO ] Invariant cache hit.
[2023-03-09 23:54:17] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2197 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 21 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 23:54:17] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:54:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 23:54:17] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-09 23:54:17] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:54:17] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:54:17] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-09 23:54:17] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-03-09 23:54:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-09 23:54:17] [INFO ] After 263ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:17] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 23:54:17] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-09 23:54:17] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:17] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:17] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2023-03-09 23:54:18] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:54:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-09 23:54:18] [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 12 ms.
[2023-03-09 23:54:18] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 10000 steps, including 885 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 509442 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 509442 steps, saw 254771 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:54:21] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:54:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:54:21] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:54:21] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:54:21] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:21] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:21] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:54:21] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:21] [INFO ] After 40ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:21] [INFO ] After 64ms 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 23:54:21] [INFO ] After 346ms 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 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 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 16 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1427 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 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 630113 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 630113 steps, saw 315131 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:54:24] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 23:54:24] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-09 23:54:24] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 23:54:25] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:25] [INFO ] After 118ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:25] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-09 23:54:25] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 23:54:25] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:25] [INFO ] After 153ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:25] [INFO ] After 176ms 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 23:54:25] [INFO ] After 423ms 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 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 23:54:25] [INFO ] Invariant cache hit.
[2023-03-09 23:54:25] [INFO ] Implicit Places using invariants in 380 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 381 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 11 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 23:54:26] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 23:54:26] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 23:54:26] [INFO ] Invariant cache hit.
[2023-03-09 23:54:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:28] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2109 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 2506 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1428 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 929 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627970 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627970 steps, saw 314055 distinct states, run finished after 3005 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:54:31] [INFO ] Invariant cache hit.
[2023-03-09 23:54:31] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 23:54:31] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:54:31] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:31] [INFO ] After 111ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:31] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 23:54:31] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:54:31] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:31] [INFO ] After 103ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:31] [INFO ] After 128ms 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 23:54:31] [INFO ] After 377ms 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 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 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 23:54:31] [INFO ] Invariant cache hit.
[2023-03-09 23:54:32] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-09 23:54:32] [INFO ] Invariant cache hit.
[2023-03-09 23:54:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:33] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
[2023-03-09 23:54:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:54:33] [INFO ] Invariant cache hit.
[2023-03-09 23:54:33] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1854 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 15 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 23:54:33] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 23:54:33] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 23:54:33] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:54:33] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:54:33] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:54:34] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-09 23:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 23:54:34] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:34] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 23:54:34] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:54:34] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:34] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:34] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2023-03-09 23:54:34] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-09 23:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-09 23:54:34] [INFO ] After 177ms 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 23:54:34] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1490 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 907 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629451 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629451 steps, saw 314798 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 23:54:37] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:54:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:37] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:54:37] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:54:37] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:54:37] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:54:38] [INFO ] After 73ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:38] [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 29 ms.
[2023-03-09 23:54:38] [INFO ] After 358ms 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 16 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 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 902 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641908 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641908 steps, saw 321027 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 23:54:41] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:54:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:41] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:54:41] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:41] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:41] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:41] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 23:54:41] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:41] [INFO ] After 121ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:41] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-09 23:54:42] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-09 23:54:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-09 23:54:42] [INFO ] After 352ms 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 23:54:42] [INFO ] After 630ms 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 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 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 23:54:42] [INFO ] Invariant cache hit.
[2023-03-09 23:54:42] [INFO ] Implicit Places using invariants in 482 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 492 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 23:54:42] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:54:42] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 23:54:42] [INFO ] Invariant cache hit.
[2023-03-09 23:54:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:44] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2162 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 2664 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1418 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 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636004 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636004 steps, saw 318076 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:54:47] [INFO ] Invariant cache hit.
[2023-03-09 23:54:47] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:54:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:54:48] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:54:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:54:48] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:48] [INFO ] After 89ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:48] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-09 23:54:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-09 23:54:48] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-09 23:54:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-09 23:54:48] [INFO ] After 499ms 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 23:54:48] [INFO ] After 779ms 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 23:54:48] [INFO ] Invariant cache hit.
[2023-03-09 23:54:49] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-09 23:54:49] [INFO ] Invariant cache hit.
[2023-03-09 23:54:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:50] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2023-03-09 23:54:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:54:50] [INFO ] Invariant cache hit.
[2023-03-09 23:54:51] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2091 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 11 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 23:54:51] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:54:51] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 23:54:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:54:51] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 23:54:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:54:51] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:54:51] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:51] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-09 23:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 23:54:51] [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 33 ms.
[2023-03-09 23:54:51] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1418 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 931 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593531 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593531 steps, saw 296828 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:54:54] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:54:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:54] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 23:54:54] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:54:54] [INFO ] After 86ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:54] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:54:55] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:54:55] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:55] [INFO ] After 212ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:55] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-09 23:54:55] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-09 23:54:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-09 23:54:55] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2023-03-09 23:54:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 292 ms
[2023-03-09 23:54:55] [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 16 ms.
[2023-03-09 23:54:55] [INFO ] After 824ms 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 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 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1425 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 914 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608885 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608885 steps, saw 304503 distinct states, run finished after 3004 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:54:58] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:54:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:58] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:54:59] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:54:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:54:59] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:59] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:54:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:54:59] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 23:54:59] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:59] [INFO ] After 88ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:54:59] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2023-03-09 23:54:59] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2023-03-09 23:54:59] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 0 ms to minimize.
[2023-03-09 23:55:00] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:55:00] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2023-03-09 23:55:00] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
[2023-03-09 23:55:00] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 0 ms to minimize.
[2023-03-09 23:55:00] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 1 ms to minimize.
[2023-03-09 23:55:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-09 23:55:01] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-09 23:55:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-09 23:55:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-09 23:55:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1968 ms
[2023-03-09 23:55:01] [INFO ] After 2075ms 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 23:55:01] [INFO ] After 2321ms 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 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 23:55:01] [INFO ] Invariant cache hit.
[2023-03-09 23:55:01] [INFO ] Implicit Places using invariants in 429 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 430 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 23:55:01] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:55:02] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-09 23:55:02] [INFO ] Invariant cache hit.
[2023-03-09 23:55:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:04] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2189 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 2631 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1448 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 871 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631742 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631742 steps, saw 315943 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:55:07] [INFO ] Invariant cache hit.
[2023-03-09 23:55:07] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:55:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:55:07] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:07] [INFO ] After 132ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:07] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:55:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:55:07] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:07] [INFO ] After 177ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:07] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-09 23:55:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-09 23:55:08] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-09 23:55:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-09 23:55:08] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 23:55:08] [INFO ] After 679ms 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 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 23:55:08] [INFO ] Invariant cache hit.
[2023-03-09 23:55:08] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 23:55:08] [INFO ] Invariant cache hit.
[2023-03-09 23:55:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:10] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2023-03-09 23:55:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:55:10] [INFO ] Invariant cache hit.
[2023-03-09 23:55:10] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2112 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 15 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 23:55:10] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:55:10] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:55:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:55:10] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:55:10] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:10] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:55:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:55:10] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:10] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-09 23:55:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2023-03-09 23:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-09 23:55:10] [INFO ] After 194ms 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 23:55:10] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1445 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 915 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613844 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613844 steps, saw 306997 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 23:55:13] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:55:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:55:13] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:55:14] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:55:14] [INFO ] After 56ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:14] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:55:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:55:14] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:14] [INFO ] After 80ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:14] [INFO ] After 102ms 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 23:55:14] [INFO ] After 359ms 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.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 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 1418 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 907 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635912 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635912 steps, saw 318029 distinct states, run finished after 3003 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:55:17] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:55:17] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 23:55:17] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 23:55:17] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:18] [INFO ] After 149ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:18] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 23:55:18] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 23:55:18] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:18] [INFO ] After 84ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:18] [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 13 ms.
[2023-03-09 23:55:18] [INFO ] After 375ms 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 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 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:55:18] [INFO ] Invariant cache hit.
[2023-03-09 23:55:18] [INFO ] Implicit Places using invariants in 425 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 426 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 23:55:18] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 23:55:19] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-09 23:55:19] [INFO ] Invariant cache hit.
[2023-03-09 23:55:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:20] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1755 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 2196 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1468 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 643387 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643387 steps, saw 321767 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:55:23] [INFO ] Invariant cache hit.
[2023-03-09 23:55:23] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-09 23:55:23] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-09 23:55:23] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:23] [INFO ] After 62ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:55:23] [INFO ] After 84ms 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 23:55:23] [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 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 23:55:23] [INFO ] Invariant cache hit.
[2023-03-09 23:55:24] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 23:55:24] [INFO ] Invariant cache hit.
[2023-03-09 23:55:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:25] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2023-03-09 23:55:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:55:25] [INFO ] Invariant cache hit.
[2023-03-09 23:55:25] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1957 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 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 23:55:25] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 23:55:26] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 23:55:26] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:55:26] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:55:26] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:55:26] [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 23:55:26] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1464 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 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622555 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622555 steps, saw 311350 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 23:55:29] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 23:55:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:55:29] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:55:29] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:55:29] [INFO ] After 67ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:29] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:55:29] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:55:29] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:29] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:29] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-03-09 23:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 23:55:29] [INFO ] After 191ms 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 23:55:29] [INFO ] After 445ms 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 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 13 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 14 ms. Remains : 229/255 places, 222/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 10000 steps, including 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645129 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 645129 steps, saw 322642 distinct states, run finished after 3004 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 23:55:33] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:55:33] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 23:55:33] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 23:55:33] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:33] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:33] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-09 23:55:33] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-09 23:55:33] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:33] [INFO ] After 63ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:33] [INFO ] After 84ms 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 23:55:33] [INFO ] After 476ms 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 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 3 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 23:55:33] [INFO ] Invariant cache hit.
[2023-03-09 23:55:34] [INFO ] Implicit Places using invariants in 379 ms returned [25, 45, 50, 71, 76, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 380 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 23:55:34] [INFO ] Computed 33 place invariants in 10 ms
[2023-03-09 23:55:34] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-09 23:55:34] [INFO ] Invariant cache hit.
[2023-03-09 23:55:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:36] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2250 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 2642 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1468 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 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635015 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635015 steps, saw 317581 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:55:39] [INFO ] Invariant cache hit.
[2023-03-09 23:55:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 23:55:39] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:39] [INFO ] After 130ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:39] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 23:55:40] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:40] [INFO ] After 259ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:40] [INFO ] After 282ms 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 23:55:40] [INFO ] After 533ms 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 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 4 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 23:55:40] [INFO ] Invariant cache hit.
[2023-03-09 23:55:40] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-09 23:55:40] [INFO ] Invariant cache hit.
[2023-03-09 23:55:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:42] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2023-03-09 23:55:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:55:42] [INFO ] Invariant cache hit.
[2023-03-09 23:55:42] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2457 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 13 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 23:55:43] [INFO ] Computed 33 place invariants in 13 ms
[2023-03-09 23:55:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 23:55:43] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 23:55:43] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:55:43] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:55:43] [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 23:55:43] [INFO ] After 227ms 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617447 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617447 steps, saw 308796 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:55:46] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:55:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:46] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:55:46] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:55:46] [INFO ] After 75ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:55:46] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 23:55:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 23:55:46] [INFO ] After 212ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:46] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:46] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 23:55:47] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:47] [INFO ] After 66ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:47] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2023-03-09 23:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-09 23:55:47] [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 45 ms.
[2023-03-09 23:55:47] [INFO ] After 502ms 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.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 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 1424 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 904 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575556 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575556 steps, saw 287841 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:55:50] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:55:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:50] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 23:55:50] [INFO ] After 221ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:50] [INFO ] After 127ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:55:50] [INFO ] After 171ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:50] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:55:50] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 23:55:51] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:51] [INFO ] After 206ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:51] [INFO ] After 272ms 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 23:55:51] [INFO ] After 566ms 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 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 23:55:51] [INFO ] Invariant cache hit.
[2023-03-09 23:55:51] [INFO ] Implicit Places using invariants in 411 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 413 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 23:55:51] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:55:52] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 23:55:52] [INFO ] Invariant cache hit.
[2023-03-09 23:55:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:53] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1891 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 2317 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 10000 steps, including 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631961 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631961 steps, saw 316053 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:55:56] [INFO ] Invariant cache hit.
[2023-03-09 23:55:56] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-09 23:55:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 23:55:56] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:55:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:57] [INFO ] After 111ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:57] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 23:55:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:55:57] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:57] [INFO ] After 310ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:55:57] [INFO ] After 331ms 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 23:55:57] [INFO ] After 598ms 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:55:57] [INFO ] Invariant cache hit.
[2023-03-09 23:55:57] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-09 23:55:57] [INFO ] Invariant cache hit.
[2023-03-09 23:55:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:55:59] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2023-03-09 23:55:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:55:59] [INFO ] Invariant cache hit.
[2023-03-09 23:55:59] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 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 13 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 23:55:59] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:55:59] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:55:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:56:00] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:56:00] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:00] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:56:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:00] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:00] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:00] [INFO ] After 27ms 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 23:56:00] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1416 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621132 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 621132 steps, saw 310638 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 23:56:03] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:56:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:56:03] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:56:03] [INFO ] After 45ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:56:03] [INFO ] After 70ms 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 23:56:03] [INFO ] After 325ms 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 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 18 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 18 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1413 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 640233 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640233 steps, saw 320191 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 23:56:06] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:56:06] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 23:56:06] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-09 23:56:06] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:07] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:07] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 23:56:07] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 28 ms returned sat
[2023-03-09 23:56:07] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:07] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:07] [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 16 ms.
[2023-03-09 23:56:07] [INFO ] After 404ms 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 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 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 23:56:07] [INFO ] Invariant cache hit.
[2023-03-09 23:56:07] [INFO ] Implicit Places using invariants in 434 ms returned [25, 45, 50, 71, 76, 96, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 436 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 12 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 23:56:07] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 23:56:08] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-09 23:56:08] [INFO ] Invariant cache hit.
[2023-03-09 23:56:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:09] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 1962 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 2415 ms. Remains : 209/227 places, 214/220 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 10001 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634510 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634510 steps, saw 317328 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:56:12] [INFO ] Invariant cache hit.
[2023-03-09 23:56:12] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 23:56:12] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:13] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:13] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:13] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-09 23:56:13] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:13] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:13] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:13] [INFO ] After 74ms 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 23:56:13] [INFO ] After 306ms 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 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 4 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 23:56:13] [INFO ] Invariant cache hit.
[2023-03-09 23:56:13] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-09 23:56:13] [INFO ] Invariant cache hit.
[2023-03-09 23:56:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:15] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2023-03-09 23:56:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:56:15] [INFO ] Invariant cache hit.
[2023-03-09 23:56:15] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2258 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 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 15 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 23:56:15] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 23:56:15] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 23:56:15] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:15] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:56:15] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:56:16] [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 23:56:16] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 912 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 607529 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607529 steps, saw 303829 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:56:19] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 23:56:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:56:19] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:56:19] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:56:19] [INFO ] After 49ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:19] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:56:19] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:56:19] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:19] [INFO ] After 71ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:19] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2023-03-09 23:56:19] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-09 23:56:19] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-09 23:56:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2023-03-09 23:56:20] [INFO ] After 401ms 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 23:56:20] [INFO ] After 681ms 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.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 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 1439 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622067 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622067 steps, saw 311103 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:56:23] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 23:56:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:23] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 23:56:23] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:23] [INFO ] After 96ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:56:23] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-09 23:56:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 23:56:23] [INFO ] After 211ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:23] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:56:23] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 23:56:23] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:23] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:23] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-09 23:56:24] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 1 ms to minimize.
[2023-03-09 23:56:24] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-09 23:56:24] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-09 23:56:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2023-03-09 23:56:24] [INFO ] After 482ms 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 23:56:24] [INFO ] After 733ms 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 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 23:56:24] [INFO ] Invariant cache hit.
[2023-03-09 23:56:24] [INFO ] Implicit Places using invariants in 481 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 482 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 23:56:24] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:56:25] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 23:56:25] [INFO ] Invariant cache hit.
[2023-03-09 23:56:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:27] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2404 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 2896 ms. Remains : 207/226 places, 213/219 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 10001 steps, including 929 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641451 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641451 steps, saw 320798 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:56:30] [INFO ] Invariant cache hit.
[2023-03-09 23:56:30] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 23:56:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 23:56:30] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:30] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:30] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 23:56:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:30] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:30] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:30] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2023-03-09 23:56:31] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-09 23:56:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-09 23:56:31] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-03-09 23:56:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 424 ms
[2023-03-09 23:56:31] [INFO ] After 478ms 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 23:56:31] [INFO ] After 748ms 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 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 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 23:56:31] [INFO ] Invariant cache hit.
[2023-03-09 23:56:31] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-09 23:56:31] [INFO ] Invariant cache hit.
[2023-03-09 23:56:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:33] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
[2023-03-09 23:56:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:56:33] [INFO ] Invariant cache hit.
[2023-03-09 23:56:34] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2879 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 0 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 13 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 23:56:34] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 23:56:34] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:56:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 23:56:34] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:56:34] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:56:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-09 23:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 23:56:34] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:34] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 23:56:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:34] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:34] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:34] [INFO ] After 27ms 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 23:56:34] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1431 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 935 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624613 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624613 steps, saw 312379 distinct states, run finished after 3004 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 23:56:37] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:56:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:56:37] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 23:56:38] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:56:38] [INFO ] After 41ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:38] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:38] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 23:56:38] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:38] [INFO ] After 59ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:38] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2023-03-09 23:56:38] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-09 23:56:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-09 23:56:38] [INFO ] After 261ms 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 23:56:38] [INFO ] After 531ms 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 15 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 909 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 638473 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638473 steps, saw 319308 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 23:56:41] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 23:56:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:41] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 23:56:41] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:42] [INFO ] After 109ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:42] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:56:42] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:56:42] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:42] [INFO ] After 240ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:42] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-09 23:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 23:56:42] [INFO ] After 371ms 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 23:56:42] [INFO ] After 652ms 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 23:56:42] [INFO ] Invariant cache hit.
[2023-03-09 23:56:43] [INFO ] Implicit Places using invariants in 509 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 510 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 8 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 23:56:43] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 23:56:43] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 23:56:43] [INFO ] Invariant cache hit.
[2023-03-09 23:56:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:45] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1803 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 2327 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1394 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 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644178 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644178 steps, saw 322162 distinct states, run finished after 3005 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:56:48] [INFO ] Invariant cache hit.
[2023-03-09 23:56:48] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 23:56:48] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:48] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:48] [INFO ] After 73ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:48] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 23:56:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:48] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:48] [INFO ] After 124ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:48] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-09 23:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 23:56:48] [INFO ] After 224ms 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 23:56:48] [INFO ] After 482ms 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 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 8 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 23:56:48] [INFO ] Invariant cache hit.
[2023-03-09 23:56:49] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 23:56:49] [INFO ] Invariant cache hit.
[2023-03-09 23:56:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 23:56:51] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-09 23:56:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:56:51] [INFO ] Invariant cache hit.
[2023-03-09 23:56:51] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2431 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 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 23:56:51] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 23:56:51] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 23:56:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:51] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:56:51] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:56:51] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-09 23:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-09 23:56:51] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:51] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 23:56:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 23:56:51] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:51] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-09 23:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 23:56:51] [INFO ] After 102ms 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 23:56:51] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1443 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624851 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624851 steps, saw 312497 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 23:56:55] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 23:56:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:55] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:56:55] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:56:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 23:56:55] [INFO ] After 62ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:55] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:56:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:56:55] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 23:56:55] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:55] [INFO ] After 82ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:56:55] [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 23:56:55] [INFO ] After 359ms 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 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 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 1405 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 896 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14035576 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16129220 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="smartxred"
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 smartxred"
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 r153-smll-167819440300297"
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 ;