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.r149-smll-167819435900297.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 lolaxred
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 r149-smll-167819435900297
=====================================================================

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

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=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 14:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 14:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:58:25] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-09 14:58:25] [INFO ] Transformed 534 places.
[2023-03-09 14:58:25] [INFO ] Transformed 498 transitions.
[2023-03-09 14:58:25] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 324 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 35 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 5 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 165 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 14:58:25] [INFO ] Computed 51 place invariants in 80 ms
[2023-03-09 14:58:26] [INFO ] Implicit Places using invariants in 1018 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1084 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 5 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 25 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 14:58:26] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-09 14:58:27] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-09 14:58:27] [INFO ] Invariant cache hit.
[2023-03-09 14:58:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 14:58:29] [INFO ] Implicit Places using invariants and state equation in 2410 ms returned []
Implicit Place search using SMT with State Equation took 2987 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 4263 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 1233 resets, run finished after 1027 ms. (steps per millisecond=9 ) properties (out of 201) seen :14
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 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 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 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 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 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) 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 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 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 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 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 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 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 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 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 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 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 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 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 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
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 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 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 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 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 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 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 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=12 ) 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 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 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
Interrupted probabilistic random walk after 97525 steps, run timeout after 3001 ms. (steps per millisecond=32 ) 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 97525 steps, saw 48768 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :35
Running SMT prover for 152 properties.
[2023-03-09 14:58:34] [INFO ] Invariant cache hit.
[2023-03-09 14:58:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:58:35] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-09 14:58:42] [INFO ] After 5394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:149
[2023-03-09 14:58:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 14:58:42] [INFO ] After 238ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 14:58:42] [INFO ] After 8480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 14:58:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:58:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 14:58:50] [INFO ] After 4642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :152
[2023-03-09 14:58:59] [INFO ] After 9388ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :152
[2023-03-09 14:59:00] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 11 ms to minimize.
[2023-03-09 14:59:00] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 2 ms to minimize.
[2023-03-09 14:59:00] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2023-03-09 14:59:00] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2023-03-09 14:59:00] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2023-03-09 14:59:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1095 ms
[2023-03-09 14:59:02] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2023-03-09 14:59:02] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2023-03-09 14:59:02] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2023-03-09 14:59:02] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-09 14:59:02] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2023-03-09 14:59:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 894 ms
[2023-03-09 14:59:03] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-09 14:59:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-09 14:59:03] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-09 14:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 14:59:04] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2023-03-09 14:59:04] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-09 14:59:04] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-09 14:59:04] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-09 14:59:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
[2023-03-09 14:59:05] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-09 14:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-09 14:59:06] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-03-09 14:59:06] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-09 14:59:06] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-09 14:59:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-03-09 14:59:07] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-09 14:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-09 14:59:07] [INFO ] After 17372ms 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 14:59:07] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :151
Parikh walk visited 0 properties in 30375 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 56 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 56 ms. Remains : 266/272 places, 254/260 transitions.
Interrupted random walk after 755662 steps, including 96886 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 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 853 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 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 845 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 267 ms. (steps per millisecond=37 ) 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 24672 ms. (steps per millisecond=34 ) properties seen :7
Interrupted probabilistic random walk after 4940503 steps, run timeout after 132001 ms. (steps per millisecond=37 ) 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 4940503 steps, saw 2470461 distinct states, run finished after 132005 ms. (steps per millisecond=37 ) properties seen :14
Running SMT prover for 131 properties.
// Phase 1: matrix 254 rows 266 cols
[2023-03-09 15:02:59] [INFO ] Computed 49 place invariants in 15 ms
[2023-03-09 15:02:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:02:59] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 15:03:05] [INFO ] After 4196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 15:03:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 15:03:05] [INFO ] After 210ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:03:05] [INFO ] After 6211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:03:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:03:06] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 36 ms returned sat
[2023-03-09 15:03:11] [INFO ] After 3814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 15:03:17] [INFO ] After 5953ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 15:03:17] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:03:17] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:03:17] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2023-03-09 15:03:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-09 15:03:25] [INFO ] After 13451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 5654 ms.
[2023-03-09 15:03:30] [INFO ] After 25411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30652 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 36 ms. Remains : 262/266 places, 250/254 transitions.
Interrupted random walk after 720828 steps, including 92498 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 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 835 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 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 849 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 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 842 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 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 827 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 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 860 resets, run finished after 229 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 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5267221 steps, run timeout after 129001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 5267221 steps, saw 2633408 distinct states, run finished after 129005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 131 properties.
// Phase 1: matrix 250 rows 262 cols
[2023-03-09 15:06:53] [INFO ] Computed 49 place invariants in 20 ms
[2023-03-09 15:06:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:06:54] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 15:06:58] [INFO ] After 2645ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 15:06:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:06:58] [INFO ] After 132ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:06:58] [INFO ] After 4398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:06:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:06:58] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-09 15:07:02] [INFO ] After 2323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 15:07:05] [INFO ] After 3895ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2023-03-09 15:07:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 377 ms
[2023-03-09 15:07:07] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-09 15:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 15:07:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-09 15:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 15:07:08] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-09 15:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 15:07:09] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-09 15:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 15:07:09] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-09 15:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 15:07:09] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2023-03-09 15:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 15:07:10] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-09 15:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 15:07:10] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2023-03-09 15:07:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-09 15:07:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-03-09 15:07:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-09 15:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 15:07:12] [INFO ] After 10835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4414 ms.
[2023-03-09 15:07:17] [INFO ] After 19142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30260 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 20 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 20 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 10 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 15:07:47] [INFO ] Invariant cache hit.
[2023-03-09 15:07:47] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-09 15:07:47] [INFO ] Invariant cache hit.
[2023-03-09 15:07:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:07:48] [INFO ] Implicit Places using invariants and state equation in 988 ms returned [20, 144, 214, 253, 259]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1148 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 34 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 15:07:48] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 15:07:48] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 15:07:48] [INFO ] Invariant cache hit.
[2023-03-09 15:07:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:07:49] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1030 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 2224 ms. Remains : 255/262 places, 248/250 transitions.
Interrupted random walk after 868876 steps, including 125462 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 896 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 900 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 916 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 914 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 945 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 912 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 905 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 926 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 911 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 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 918 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 913 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 928 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 909 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 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 903 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 938 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 909 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 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 910 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 916 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 370 ms. (steps per millisecond=27 ) 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 907 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 916 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 913 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 915 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 909 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 934 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 940 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 912 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 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 901 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 928 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 885 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 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 929 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5045467 steps, run timeout after 123001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 5045467 steps, saw 2522408 distinct states, run finished after 123002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 15:10:34] [INFO ] Invariant cache hit.
[2023-03-09 15:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:10:35] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:10:40] [INFO ] After 4523ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:128
[2023-03-09 15:10:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:10:41] [INFO ] After 277ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :3 real:128
[2023-03-09 15:10:41] [INFO ] After 485ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:10:41] [INFO ] After 7100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:10:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:10:42] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 15:10:47] [INFO ] After 3235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 15:10:52] [INFO ] After 5395ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 15:10:58] [INFO ] After 11451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 5817 ms.
[2023-03-09 15:11:04] [INFO ] After 22869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30947 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 9 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 8 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 15:11:35] [INFO ] Invariant cache hit.
[2023-03-09 15:11:35] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 15:11:35] [INFO ] Invariant cache hit.
[2023-03-09 15:11:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:11:36] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-09 15:11:36] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 15:11:36] [INFO ] Invariant cache hit.
[2023-03-09 15:11:36] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1499 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14374 resets, run finished after 5906 ms. (steps per millisecond=16 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 15:11:42] [INFO ] Invariant cache hit.
[2023-03-09 15:11:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:11:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 15:11:43] [INFO ] After 794ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 15:11:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:11:44] [INFO ] After 959ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 15:11:44] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 342 ms
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 5 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 7 ms to minimize.
[2023-03-09 15:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-09 15:11:50] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2023-03-09 15:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 15:11:50] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 4 ms to minimize.
[2023-03-09 15:11:50] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2023-03-09 15:11:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-09 15:11:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2023-03-09 15:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-09 15:11:51] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2023-03-09 15:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 15:11:52] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2023-03-09 15:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 15:11:56] [INFO ] After 12597ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 15:11:56] [INFO ] After 13672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 15:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:11:56] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 15:11:57] [INFO ] After 1079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 15:11:59] [INFO ] After 1296ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 550 ms
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2864 ms
[2023-03-09 15:12:03] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2023-03-09 15:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-09 15:12:04] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-09 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-09 15:12:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-09 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 15:12:06] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2023-03-09 15:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 15:12:07] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2023-03-09 15:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-09 15:12:08] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-09 15:12:10] [INFO ] After 12936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 4498 ms.
[2023-03-09 15:12:15] [INFO ] After 18925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Interrupted random walk after 786664 steps, including 113929 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 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 911 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 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 919 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 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 896 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 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 934 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 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 960 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 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 913 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5188628 steps, run timeout after 123001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 5188628 steps, saw 2593964 distinct states, run finished after 123003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 15:15:00] [INFO ] Invariant cache hit.
[2023-03-09 15:15:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:15:01] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:15:05] [INFO ] After 2990ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:128
[2023-03-09 15:15:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:15:05] [INFO ] After 181ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :3 real:128
[2023-03-09 15:15:05] [INFO ] After 316ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:15:05] [INFO ] After 5123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 15:15:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:15:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:15:09] [INFO ] After 2472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 15:15:13] [INFO ] After 3793ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 15:15:17] [INFO ] After 7788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4534 ms.
[2023-03-09 15:15:21] [INFO ] After 16332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 31141 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 13 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 13 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 15:15:52] [INFO ] Invariant cache hit.
[2023-03-09 15:15:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-09 15:15:53] [INFO ] Invariant cache hit.
[2023-03-09 15:15:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:15:53] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-09 15:15:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 15:15:53] [INFO ] Invariant cache hit.
[2023-03-09 15:15:53] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 900 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14368 resets, run finished after 3769 ms. (steps per millisecond=26 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 15:15:57] [INFO ] Invariant cache hit.
[2023-03-09 15:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:15:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:15:58] [INFO ] After 743ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 15:15:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:15:59] [INFO ] After 989ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 15:15:59] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2023-03-09 15:15:59] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2023-03-09 15:15:59] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2023-03-09 15:15:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-09 15:15:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 269 ms
[2023-03-09 15:16:00] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 15:16:00] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-09 15:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 15:16:01] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-09 15:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 15:16:01] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-09 15:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 15:16:01] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-09 15:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 15:16:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:16:01] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:16:02] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-09 15:16:02] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2023-03-09 15:16:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2023-03-09 15:16:02] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-09 15:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-09 15:16:02] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-09 15:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-09 15:16:04] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2023-03-09 15:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 15:16:05] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2023-03-09 15:16:05] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-09 15:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-03-09 15:16:06] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2023-03-09 15:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 15:16:06] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2023-03-09 15:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 15:16:07] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-09 15:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-09 15:16:11] [INFO ] After 12559ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 15:16:11] [INFO ] After 13569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 15:16:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:16:11] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 15:16:12] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 15:16:14] [INFO ] After 1407ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 15:16:14] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-09 15:16:14] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:16:14] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:16:14] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-09 15:16:14] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-09 15:16:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 655 ms
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2023-03-09 15:16:15] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-09 15:16:16] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 3 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2023-03-09 15:16:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2917 ms
[2023-03-09 15:16:18] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-09 15:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 15:16:19] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-09 15:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-09 15:16:19] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-09 15:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-09 15:16:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2023-03-09 15:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 15:16:22] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2023-03-09 15:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-09 15:16:24] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2023-03-09 15:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-09 15:16:26] [INFO ] After 14324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 4312 ms.
[2023-03-09 15:16:31] [INFO ] After 20106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Incomplete random walk after 10000 steps, including 1425 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 945 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 670720 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 670720 steps, saw 335436 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:16:34] [INFO ] Invariant cache hit.
[2023-03-09 15:16:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:16:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:16:34] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:16:34] [INFO ] After 56ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:34] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:16:34] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:16:34] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:35] [INFO ] After 137ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:35] [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 20 ms.
[2023-03-09 15:16:35] [INFO ] After 423ms 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 79 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 80 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 583305 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583305 steps, saw 291711 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 15:16:38] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 15:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-09 15:16:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 15:16:38] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:16:38] [INFO ] After 62ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:38] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:16:38] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-09 15:16:38] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:38] [INFO ] After 119ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:38] [INFO ] After 152ms 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 15:16:39] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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 17 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 17 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 13 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 15:16:39] [INFO ] Invariant cache hit.
[2023-03-09 15:16:39] [INFO ] Implicit Places using invariants in 655 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 661 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 36 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 15:16:39] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-09 15:16:40] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-09 15:16:40] [INFO ] Invariant cache hit.
[2023-03-09 15:16:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:16:42] [INFO ] Implicit Places using invariants and state equation in 2715 ms returned []
Implicit Place search using SMT with State Equation took 3103 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 3817 ms. Remains : 208/228 places, 214/221 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 896 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667867 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667867 steps, saw 334007 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:16:45] [INFO ] Invariant cache hit.
[2023-03-09 15:16:45] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:16:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:16:46] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:16:46] [INFO ] After 37ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:46] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-09 15:16:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:16:46] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:46] [INFO ] After 52ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:46] [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 18 ms.
[2023-03-09 15:16:46] [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 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 16 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 16 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 12 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:16:46] [INFO ] Invariant cache hit.
[2023-03-09 15:16:46] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 15:16:46] [INFO ] Invariant cache hit.
[2023-03-09 15:16:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:16:49] [INFO ] Implicit Places using invariants and state equation in 2666 ms returned []
Implicit Place search using SMT with State Equation took 3057 ms to find 0 implicit places.
[2023-03-09 15:16:49] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 15:16:49] [INFO ] Invariant cache hit.
[2023-03-09 15:16:49] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3414 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 30 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 15:16:49] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 15:16:50] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:16:50] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:16:50] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:16:50] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:50] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:16:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:16:50] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:50] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:50] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 15:16:50] [INFO ] After 110ms 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 15:16:50] [INFO ] After 335ms 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 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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 684783 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 684783 steps, saw 342463 distinct states, run finished after 3005 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:16:53] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:16:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:16:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:16:53] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:16:53] [INFO ] After 43ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:53] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:16:54] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 33 ms returned sat
[2023-03-09 15:16:54] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:54] [INFO ] After 46ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:54] [INFO ] After 79ms 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 15:16:54] [INFO ] After 492ms 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 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 36 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 36 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622336 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622336 steps, saw 311239 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:16:57] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 15:16:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:16:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 15:16:57] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:16:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:16:57] [INFO ] After 118ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:57] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:16:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:16:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 37 ms returned sat
[2023-03-09 15:16:58] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:58] [INFO ] After 141ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:16:58] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:16:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 15:16:58] [INFO ] After 340ms 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 15:16:58] [INFO ] After 659ms 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 11 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 12 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 9 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 15:16:58] [INFO ] Invariant cache hit.
[2023-03-09 15:16:59] [INFO ] Implicit Places using invariants in 638 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 645 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 28 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 15:16:59] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-09 15:16:59] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 15:16:59] [INFO ] Invariant cache hit.
[2023-03-09 15:16:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:02] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 2852 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 3534 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1481 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 914 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 582436 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 582436 steps, saw 291281 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:17:05] [INFO ] Invariant cache hit.
[2023-03-09 15:17:05] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:17:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:17:05] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:05] [INFO ] After 233ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:05] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:17:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:17:05] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:06] [INFO ] After 341ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:06] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-09 15:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-09 15:17:06] [INFO ] After 525ms 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 15:17:06] [INFO ] After 853ms 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 9 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 9 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 8 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:17:06] [INFO ] Invariant cache hit.
[2023-03-09 15:17:06] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 15:17:06] [INFO ] Invariant cache hit.
[2023-03-09 15:17:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:09] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2023-03-09 15:17:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:17:09] [INFO ] Invariant cache hit.
[2023-03-09 15:17:09] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2886 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 17 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 15:17:09] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 15:17:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 15:17:09] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 15:17:09] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:17:09] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:09] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 15:17:09] [INFO ] After 169ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:09] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 15:17:09] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-09 15:17:09] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:09] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:10] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2023-03-09 15:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-09 15:17:10] [INFO ] After 205ms 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 15:17:10] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622169 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622169 steps, saw 311158 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 15:17:13] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:17:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:17:13] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:17:13] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:17:13] [INFO ] After 45ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:13] [INFO ] After 82ms 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 15:17:13] [INFO ] After 437ms 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 31 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 32 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597128 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 597128 steps, saw 298634 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:17:16] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:17:16] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-09 15:17:16] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 15:17:16] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:17] [INFO ] After 118ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:17] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-09 15:17:17] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 15:17:17] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:17] [INFO ] After 158ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:17] [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 20 ms.
[2023-03-09 15:17:17] [INFO ] After 444ms 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 7 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:17:17] [INFO ] Invariant cache hit.
[2023-03-09 15:17:18] [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 500 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 21 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 15:17:18] [INFO ] Computed 32 place invariants in 19 ms
[2023-03-09 15:17:18] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-09 15:17:18] [INFO ] Invariant cache hit.
[2023-03-09 15:17:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:20] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2327 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 2855 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1424 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 920 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624162 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 624162 steps, saw 312152 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:17:23] [INFO ] Invariant cache hit.
[2023-03-09 15:17:23] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 15:17:23] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:17:23] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:23] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:23] [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 11 ms.
[2023-03-09 15:17:23] [INFO ] After 295ms 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 6 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 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 15:17:23] [INFO ] Invariant cache hit.
[2023-03-09 15:17:24] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 15:17:24] [INFO ] Invariant cache hit.
[2023-03-09 15:17:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:25] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
[2023-03-09 15:17:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:17:25] [INFO ] Invariant cache hit.
[2023-03-09 15:17:26] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2267 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 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 15:17:26] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 15:17:26] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 15:17:26] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 15:17:26] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:17:26] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:26] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 15:17:26] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1439 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 897 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 679103 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679103 steps, saw 339626 distinct states, run finished after 3002 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:17:29] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:17:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:17:29] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 15:17:29] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:17:29] [INFO ] After 52ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:29] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 15:17:29] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 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 1439 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 915 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660508 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660508 steps, saw 330329 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:17:32] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:17:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:17:32] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 15:17:33] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:33] [INFO ] After 68ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:33] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:17:33] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 35 ms returned sat
[2023-03-09 15:17:33] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:33] [INFO ] After 66ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:33] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 15:17:33] [INFO ] After 480ms 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 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 15:17:33] [INFO ] Invariant cache hit.
[2023-03-09 15:17:34] [INFO ] Implicit Places using invariants in 676 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 679 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 21 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 15:17:34] [INFO ] Computed 32 place invariants in 15 ms
[2023-03-09 15:17:34] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 15:17:34] [INFO ] Invariant cache hit.
[2023-03-09 15:17:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:37] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 2959 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 3668 ms. Remains : 209/227 places, 214/220 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 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660146 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 660146 steps, saw 330148 distinct states, run finished after 3004 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:17:40] [INFO ] Invariant cache hit.
[2023-03-09 15:17:40] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 15:17:40] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:17:40] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:40] [INFO ] After 226ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:40] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2023-03-09 15:17:40] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:17:41] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:41] [INFO ] After 74ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:41] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 15:17:41] [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 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 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 15:17:41] [INFO ] Invariant cache hit.
[2023-03-09 15:17:41] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-09 15:17:41] [INFO ] Invariant cache hit.
[2023-03-09 15:17:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:44] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 3098 ms to find 0 implicit places.
[2023-03-09 15:17:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:17:44] [INFO ] Invariant cache hit.
[2023-03-09 15:17:44] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3329 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 16 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 15:17:44] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 15:17:44] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 15:17:44] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:17:44] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:17:44] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:44] [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 15:17:44] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648954 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648954 steps, saw 324547 distinct states, run finished after 3002 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:17:47] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:17:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:17:47] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:17:48] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:17:48] [INFO ] After 54ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:48] [INFO ] After 75ms 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 15:17:48] [INFO ] After 347ms 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 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 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1439 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 681217 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 681217 steps, saw 340683 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:17:51] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:17:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:17:51] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 33 ms returned sat
[2023-03-09 15:17:51] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:51] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:17:51] [INFO ] After 115ms 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 15:17:51] [INFO ] After 358ms 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 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 5 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:17:51] [INFO ] Invariant cache hit.
[2023-03-09 15:17:52] [INFO ] Implicit Places using invariants in 469 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 471 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 15:17:52] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 15:17:52] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-09 15:17:52] [INFO ] Invariant cache hit.
[2023-03-09 15:17:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:55] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned []
Implicit Place search using SMT with State Equation took 3243 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 3734 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 686713 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686713 steps, saw 343434 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:17:58] [INFO ] Invariant cache hit.
[2023-03-09 15:17:58] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 15:17:58] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 15:17:58] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:17:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:17:58] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:58] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 15:17:58] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 15:17:58] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:58] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:58] [INFO ] After 59ms 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 15:17:59] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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 4 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 15:17:59] [INFO ] Invariant cache hit.
[2023-03-09 15:17:59] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 15:17:59] [INFO ] Invariant cache hit.
[2023-03-09 15:17:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:01] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-09 15:18:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:18:01] [INFO ] Invariant cache hit.
[2023-03-09 15:18:01] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2852 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 17 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 15:18:01] [INFO ] Computed 33 place invariants in 17 ms
[2023-03-09 15:18:01] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-09 15:18:01] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 15:18:02] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:18:02] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:02] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-09 15:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 15:18:02] [INFO ] After 177ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:02] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-09 15:18:02] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 15:18:02] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:02] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:02] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 15:18:02] [INFO ] After 110ms 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 15:18:02] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1496 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
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 11 ms. (steps per millisecond=184 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 12 ms. (steps per millisecond=169 ) properties seen :1
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651980 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651980 steps, saw 326064 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:18:05] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:18:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:05] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 15:18:06] [INFO ] After 198ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:18:06] [INFO ] After 39ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:06] [INFO ] After 72ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:06] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:18:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:18:06] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:06] [INFO ] After 45ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:06] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-09 15:18:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-09 15:18:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-03-09 15:18:06] [INFO ] After 281ms 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 15:18:06] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 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 20 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1446 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 926 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675467 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675467 steps, saw 337805 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:18:09] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:18:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:18:09] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:18:10] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:10] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:10] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:10] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:18:10] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:18:10] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:10] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:10] [INFO ] After 79ms 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 15:18:10] [INFO ] After 340ms 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 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 15:18:10] [INFO ] Invariant cache hit.
[2023-03-09 15:18:11] [INFO ] Implicit Places using invariants in 517 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 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 15:18:11] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 15:18:11] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-09 15:18:11] [INFO ] Invariant cache hit.
[2023-03-09 15:18:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:12] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1689 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 2222 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 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 679936 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679936 steps, saw 340043 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:18:15] [INFO ] Invariant cache hit.
[2023-03-09 15:18:15] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:18:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:18:15] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:16] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:16] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:18:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:18:16] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:16] [INFO ] After 169ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:16] [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 15:18:16] [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 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 15:18:16] [INFO ] Invariant cache hit.
[2023-03-09 15:18:16] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 15:18:16] [INFO ] Invariant cache hit.
[2023-03-09 15:18:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:19] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-09 15:18:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:18:19] [INFO ] Invariant cache hit.
[2023-03-09 15:18:19] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2765 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 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 15:18:19] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:18:19] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:18:19] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:18:19] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:18:19] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:19] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:19] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:18:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:18:19] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:19] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:19] [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 15:18:19] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659237 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659237 steps, saw 329692 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:18:22] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:18:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:22] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:18:23] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:18:23] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:23] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:23] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 15:18:23] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:23] [INFO ] After 35ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:23] [INFO ] After 56ms 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 15:18:23] [INFO ] After 289ms 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 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 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 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657260 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657260 steps, saw 328699 distinct states, run finished after 3004 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:18:26] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:18:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:18:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 15:18:26] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:26] [INFO ] After 33ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:26] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:26] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 15:18:26] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:27] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:27] [INFO ] After 83ms 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 15:18:27] [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 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 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 15:18:27] [INFO ] Invariant cache hit.
[2023-03-09 15:18:27] [INFO ] Implicit Places using invariants in 548 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 550 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 15:18:27] [INFO ] Computed 32 place invariants in 16 ms
[2023-03-09 15:18:28] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-09 15:18:28] [INFO ] Invariant cache hit.
[2023-03-09 15:18:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:30] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 2810 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 3384 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1424 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 933 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 666811 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666811 steps, saw 333479 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:18:33] [INFO ] Invariant cache hit.
[2023-03-09 15:18:33] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 15:18:33] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:18:33] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:33] [INFO ] After 188ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:33] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-09 15:18:34] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:18:34] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:34] [INFO ] After 268ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:34] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 15:18:34] [INFO ] After 466ms 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 15:18:34] [INFO ] After 867ms 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 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:18:34] [INFO ] Invariant cache hit.
[2023-03-09 15:18:35] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-09 15:18:35] [INFO ] Invariant cache hit.
[2023-03-09 15:18:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:37] [INFO ] Implicit Places using invariants and state equation in 2477 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
[2023-03-09 15:18:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:18:37] [INFO ] Invariant cache hit.
[2023-03-09 15:18:37] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3077 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 22 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 15:18:37] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 15:18:38] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 15:18:38] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:18:38] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:18:38] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:38] [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 16 ms.
[2023-03-09 15:18:38] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1416 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 915 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619386 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619386 steps, saw 309765 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 15:18:41] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:18:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:18:41] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:18:41] [INFO ] After 291ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:18:41] [INFO ] After 58ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:41] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 15:18:41] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 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 1474 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636053 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636053 steps, saw 318098 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:18:44] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 15:18:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:18:44] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:18:45] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:45] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:45] [INFO ] After 73ms 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 15:18:45] [INFO ] After 369ms 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 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:18:45] [INFO ] Invariant cache hit.
[2023-03-09 15:18:45] [INFO ] Implicit Places using invariants in 486 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 488 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 13 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 15:18:45] [INFO ] Computed 32 place invariants in 18 ms
[2023-03-09 15:18:46] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-09 15:18:46] [INFO ] Invariant cache hit.
[2023-03-09 15:18:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:49] [INFO ] Implicit Places using invariants and state equation in 3085 ms returned []
Implicit Place search using SMT with State Equation took 3485 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 3991 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1450 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 944 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648442 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648442 steps, saw 324293 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:18:52] [INFO ] Invariant cache hit.
[2023-03-09 15:18:52] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 15:18:52] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:18:52] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:52] [INFO ] After 154ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:52] [INFO ] After 187ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 15:18:52] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 15:18:52] [INFO ] Invariant cache hit.
[2023-03-09 15:18:53] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-09 15:18:53] [INFO ] Invariant cache hit.
[2023-03-09 15:18:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:18:56] [INFO ] Implicit Places using invariants and state equation in 2875 ms returned []
Implicit Place search using SMT with State Equation took 3260 ms to find 0 implicit places.
[2023-03-09 15:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:18:56] [INFO ] Invariant cache hit.
[2023-03-09 15:18:56] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3542 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 16 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 15:18:56] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 15:18:56] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 15:18:56] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:18:56] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:18:56] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:18:56] [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 13 ms.
[2023-03-09 15:18:56] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1468 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 915 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621293 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621293 steps, saw 310718 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 15:18:59] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:18:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:59] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:18:59] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:18:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:19:00] [INFO ] After 97ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:00] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:19:00] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:19:00] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:00] [INFO ] After 84ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:00] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 15:19:00] [INFO ] After 524ms 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 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 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 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 914 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589327 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589327 steps, saw 294724 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:19:03] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:19:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 15:19:03] [INFO ] After 201ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:04] [INFO ] After 105ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:04] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:04] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 37 ms returned sat
[2023-03-09 15:19:04] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:04] [INFO ] After 144ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:04] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 15:19:04] [INFO ] After 585ms 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 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 15:19:04] [INFO ] Invariant cache hit.
[2023-03-09 15:19:05] [INFO ] Implicit Places using invariants in 608 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 609 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 15:19:05] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-09 15:19:05] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-09 15:19:05] [INFO ] Invariant cache hit.
[2023-03-09 15:19:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:07] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2224 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 2858 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1469 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 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613806 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613806 steps, saw 306971 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:19:10] [INFO ] Invariant cache hit.
[2023-03-09 15:19:10] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:19:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:19:10] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:10] [INFO ] After 33ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:10] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:19:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:19:11] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:11] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:11] [INFO ] After 103ms 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 15:19:11] [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 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:19:11] [INFO ] Invariant cache hit.
[2023-03-09 15:19:11] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-09 15:19:11] [INFO ] Invariant cache hit.
[2023-03-09 15:19:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:13] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-09 15:19:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:19:13] [INFO ] Invariant cache hit.
[2023-03-09 15:19:13] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2714 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 18 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 15:19:13] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:19:14] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:19:14] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-09 15:19:14] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:19:14] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:14] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:19:14] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-09 15:19:14] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:14] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:14] [INFO ] After 34ms 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 15:19:14] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1408 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 921 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620075 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620075 steps, saw 310110 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 15:19:17] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:19:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:17] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:19:17] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:17] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:19:18] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:19:18] [INFO ] After 111ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:18] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 15:19:18] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 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 24 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1418 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 948 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653665 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653665 steps, saw 326905 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:19:21] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:19:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:19:21] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 15:19:21] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:19:21] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 15:19:21] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:21] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:22] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-09 15:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-09 15:19:22] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 15:19:22] [INFO ] After 538ms 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 7 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 15:19:22] [INFO ] Invariant cache hit.
[2023-03-09 15:19:22] [INFO ] Implicit Places using invariants in 598 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 600 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 13 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 15:19:22] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:19:23] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 15:19:23] [INFO ] Invariant cache hit.
[2023-03-09 15:19:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:25] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2217 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 2837 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 901 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 671970 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671970 steps, saw 336062 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:19:28] [INFO ] Invariant cache hit.
[2023-03-09 15:19:28] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:19:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:19:28] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:19:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:19:28] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:28] [INFO ] After 111ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:28] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:19:28] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-09 15:19:29] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-09 15:19:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2023-03-09 15:19:29] [INFO ] After 577ms 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 15:19:29] [INFO ] After 886ms 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 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 15:19:29] [INFO ] Invariant cache hit.
[2023-03-09 15:19:29] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-09 15:19:29] [INFO ] Invariant cache hit.
[2023-03-09 15:19:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:31] [INFO ] Implicit Places using invariants and state equation in 2412 ms returned []
Implicit Place search using SMT with State Equation took 2805 ms to find 0 implicit places.
[2023-03-09 15:19:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:19:31] [INFO ] Invariant cache hit.
[2023-03-09 15:19:32] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3093 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 17 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 15:19:32] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 15:19:32] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:19:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:19:32] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 15:19:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 15:19:32] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:19:32] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:32] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-09 15:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 15:19:32] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 15:19:33] [INFO ] After 481ms 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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 566600 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566600 steps, saw 283361 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:19:36] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:19:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:36] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:19:36] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:19:36] [INFO ] After 145ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:19:36] [INFO ] After 182ms 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 15:19:36] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 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 25 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1409 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 892 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623039 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623039 steps, saw 311591 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:19:39] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:19:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:19:39] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:19:39] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:39] [INFO ] After 34ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:19:39] [INFO ] After 66ms 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 15:19:39] [INFO ] After 302ms 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 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 15:19:39] [INFO ] Invariant cache hit.
[2023-03-09 15:19:40] [INFO ] Implicit Places using invariants in 588 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 589 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 8 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 15:19:40] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:19:40] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-09 15:19:40] [INFO ] Invariant cache hit.
[2023-03-09 15:19:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:43] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 2791 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 3394 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1474 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 932 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657447 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657447 steps, saw 328799 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:19:46] [INFO ] Invariant cache hit.
[2023-03-09 15:19:46] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-09 15:19:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:19:46] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:46] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:46] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2023-03-09 15:19:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:19:46] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:47] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:47] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 15:19:47] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 15:19:47] [INFO ] Invariant cache hit.
[2023-03-09 15:19:47] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-09 15:19:47] [INFO ] Invariant cache hit.
[2023-03-09 15:19:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:50] [INFO ] Implicit Places using invariants and state equation in 2707 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2023-03-09 15:19:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:19:50] [INFO ] Invariant cache hit.
[2023-03-09 15:19:50] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3392 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 15:19:50] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:19:50] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:19:50] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:19:50] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:19:50] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:50] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:19:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:19:50] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:50] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:51] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2023-03-09 15:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 15:19:51] [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 15:19:51] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1434 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 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617087 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617087 steps, saw 308616 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 15:19:54] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:19:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:19:54] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:19:54] [INFO ] After 173ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:19:54] [INFO ] After 156ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:19:54] [INFO ] After 192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 15:19:54] [INFO ] After 468ms 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 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 25 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1429 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 929 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627061 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 627061 steps, saw 313604 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 15:19:57] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:19:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:19:57] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:19:57] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:19:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:19:58] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:58] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:19:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:19:58] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 15:19:58] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:58] [INFO ] After 111ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:19:58] [INFO ] After 144ms 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 15:19:58] [INFO ] After 473ms 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 7 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 15:19:58] [INFO ] Invariant cache hit.
[2023-03-09 15:19:59] [INFO ] Implicit Places using invariants in 646 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 648 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 13 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 15:19:59] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:19:59] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-09 15:19:59] [INFO ] Invariant cache hit.
[2023-03-09 15:19:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:01] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2528 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 3198 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1447 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 913 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639759 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639759 steps, saw 319953 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:20:04] [INFO ] Invariant cache hit.
[2023-03-09 15:20:04] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 15:20:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 15:20:05] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:05] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:20:05] [INFO ] After 102ms 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 15:20:05] [INFO ] After 370ms 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 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 15:20:05] [INFO ] Invariant cache hit.
[2023-03-09 15:20:05] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-09 15:20:05] [INFO ] Invariant cache hit.
[2023-03-09 15:20:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:08] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-09 15:20:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:20:08] [INFO ] Invariant cache hit.
[2023-03-09 15:20:08] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3297 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 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 15:20:08] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 15:20:08] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:20:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:20:08] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:20:08] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:08] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:20:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:20:08] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:08] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-09 15:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 15:20:09] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 15:20:09] [INFO ] After 391ms 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 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649734 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649734 steps, saw 324942 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:20:12] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:20:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:12] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:20:12] [INFO ] After 268ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:20:12] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:12] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:20:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:20:13] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:13] [INFO ] After 91ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:13] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:20:13] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-09 15:20:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-03-09 15:20:13] [INFO ] After 480ms 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 15:20:13] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 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 24 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1485 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 567824 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567824 steps, saw 283972 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 15:20:16] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:20:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:16] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:20:16] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:17] [INFO ] After 226ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:17] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:20:17] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 15:20:17] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:17] [INFO ] After 117ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:17] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-09 15:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 15:20:17] [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 20 ms.
[2023-03-09 15:20:17] [INFO ] After 604ms 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 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 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 15:20:17] [INFO ] Invariant cache hit.
[2023-03-09 15:20:18] [INFO ] Implicit Places using invariants in 661 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 662 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 15:20:18] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 15:20:18] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-09 15:20:18] [INFO ] Invariant cache hit.
[2023-03-09 15:20:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:20] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2262 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 2942 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1495 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 897 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598184 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598184 steps, saw 299157 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:20:23] [INFO ] Invariant cache hit.
[2023-03-09 15:20:23] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:20:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:20:23] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:23] [INFO ] After 98ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:23] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:20:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:20:24] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:24] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:24] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-09 15:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-09 15:20:24] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 15:20:24] [INFO ] After 627ms 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:20:24] [INFO ] Invariant cache hit.
[2023-03-09 15:20:24] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-09 15:20:24] [INFO ] Invariant cache hit.
[2023-03-09 15:20:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:27] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2023-03-09 15:20:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:20:27] [INFO ] Invariant cache hit.
[2023-03-09 15:20:27] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2741 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 18 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 15:20:27] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 15:20:27] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:20:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:20:27] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:20:27] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:20:27] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-09 15:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 15:20:27] [INFO ] After 128ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:27] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:20:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:20:27] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:27] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:28] [INFO ] After 33ms 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 15:20:28] [INFO ] After 283ms 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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623879 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623879 steps, saw 312011 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 15:20:31] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 15:20:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:20:31] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:20:31] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:20:31] [INFO ] After 56ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:31] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:31] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:20:31] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:31] [INFO ] After 87ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:31] [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 27 ms.
[2023-03-09 15:20:31] [INFO ] After 520ms 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 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 15 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 15 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 663572 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663572 steps, saw 331854 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 15:20:34] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:35] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 15:20:35] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:35] [INFO ] After 55ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:35] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:35] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 15:20:35] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:35] [INFO ] After 95ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:35] [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 20 ms.
[2023-03-09 15:20:35] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 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 7 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 8 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 7 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 15:20:35] [INFO ] Invariant cache hit.
[2023-03-09 15:20:36] [INFO ] Implicit Places using invariants in 717 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 719 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 13 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 15:20:36] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:20:36] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 15:20:36] [INFO ] Invariant cache hit.
[2023-03-09 15:20:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:38] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2458 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 3199 ms. Remains : 208/228 places, 214/221 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 10000 steps, including 900 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661270 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661270 steps, saw 330709 distinct states, run finished after 3003 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:20:41] [INFO ] Invariant cache hit.
[2023-03-09 15:20:41] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:20:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:20:42] [INFO ] After 188ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:42] [INFO ] After 56ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:42] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 15:20:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:20:42] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:42] [INFO ] After 71ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:42] [INFO ] After 99ms 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 15:20:42] [INFO ] After 406ms 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 15:20:42] [INFO ] Invariant cache hit.
[2023-03-09 15:20:42] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-09 15:20:42] [INFO ] Invariant cache hit.
[2023-03-09 15:20:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:45] [INFO ] Implicit Places using invariants and state equation in 2359 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
[2023-03-09 15:20:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:20:45] [INFO ] Invariant cache hit.
[2023-03-09 15:20:45] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3020 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 17 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 15:20:45] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 15:20:45] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:20:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:20:45] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:20:45] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:45] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 15:20:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:20:46] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:46] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 675 ms
[2023-03-09 15:20:46] [INFO ] After 703ms 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 15:20:46] [INFO ] After 960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1464 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 599202 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599202 steps, saw 299662 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 15:20:49] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 15:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:49] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:20:50] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:50] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:20:50] [INFO ] After 40ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:50] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:20:50] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:20:50] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:50] [INFO ] After 57ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:50] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2023-03-09 15:20:50] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-09 15:20:50] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:20:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2023-03-09 15:20:50] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 15:20:50] [INFO ] After 873ms 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 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 25 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1456 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 927 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 630548 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 630548 steps, saw 315343 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:20:54] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 15:20:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:20:54] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 15:20:54] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:20:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:54] [INFO ] After 55ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:54] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:20:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:20:54] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 37 ms returned sat
[2023-03-09 15:20:54] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:54] [INFO ] After 221ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:20:54] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-09 15:20:55] [INFO ] After 398ms 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 15:20:55] [INFO ] After 725ms 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 15:20:55] [INFO ] Invariant cache hit.
[2023-03-09 15:20:55] [INFO ] Implicit Places using invariants in 590 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 592 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 15:20:55] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:20:56] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 15:20:56] [INFO ] Invariant cache hit.
[2023-03-09 15:20:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:20:58] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2631 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 3249 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1459 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 937 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 682162 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682162 steps, saw 341158 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:21:01] [INFO ] Invariant cache hit.
[2023-03-09 15:21:01] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-09 15:21:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:21:01] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:01] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:01] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-09 15:21:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:21:02] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:02] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:02] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-09 15:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 15:21:02] [INFO ] After 226ms 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 15:21:02] [INFO ] After 552ms 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 9 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 9 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 15:21:02] [INFO ] Invariant cache hit.
[2023-03-09 15:21:02] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 15:21:02] [INFO ] Invariant cache hit.
[2023-03-09 15:21:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:05] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 2880 ms to find 0 implicit places.
[2023-03-09 15:21:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:21:05] [INFO ] Invariant cache hit.
[2023-03-09 15:21:05] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3182 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 19 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 15:21:05] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 15:21:05] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 15:21:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:21:05] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:21:05] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:21:05] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 15:21:05] [INFO ] After 165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:05] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 15:21:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:21:06] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:06] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:06] [INFO ] After 39ms 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 15:21:06] [INFO ] After 336ms 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 916 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646651 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646651 steps, saw 323397 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:21:09] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:09] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:21:09] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:21:09] [INFO ] After 61ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:09] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:09] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:21:09] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:09] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:09] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 15:21:10] [INFO ] After 378ms 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 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 16 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 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 909 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639259 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639259 steps, saw 319704 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:21:13] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:21:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:21:13] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 21 ms returned sat
[2023-03-09 15:21:13] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:13] [INFO ] After 36ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:21:13] [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 12 ms.
[2023-03-09 15:21:13] [INFO ] After 283ms 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 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 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:21:13] [INFO ] Invariant cache hit.
[2023-03-09 15:21:13] [INFO ] Implicit Places using invariants in 525 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 527 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 16 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 15:21:13] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 15:21:14] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-09 15:21:14] [INFO ] Invariant cache hit.
[2023-03-09 15:21:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:15] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1800 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 2347 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1463 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 894 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 709942 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 709942 steps, saw 355050 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:21:18] [INFO ] Invariant cache hit.
[2023-03-09 15:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:18] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-09 15:21:18] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:19] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:19] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:19] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-09 15:21:19] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:19] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:19] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 15:21:19] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 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 15:21:19] [INFO ] Invariant cache hit.
[2023-03-09 15:21:19] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 15:21:19] [INFO ] Invariant cache hit.
[2023-03-09 15:21:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:21] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-09 15:21:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:21:21] [INFO ] Invariant cache hit.
[2023-03-09 15:21:21] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 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 15:21:21] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 15:21:21] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-09 15:21:21] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:21:21] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:21:21] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:21:21] [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 15:21:21] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631583 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631583 steps, saw 315866 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:21:24] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:24] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:21:25] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:21:25] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:21:25] [INFO ] After 41ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:25] [INFO ] After 77ms 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 15:21:25] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 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 20 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1477 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 925 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 682092 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682092 steps, saw 341121 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:21:28] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:21:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:28] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:21:28] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:28] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:28] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:28] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:21:28] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:28] [INFO ] After 36ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:28] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:21:29] [INFO ] After 302ms 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 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 15:21:29] [INFO ] Invariant cache hit.
[2023-03-09 15:21:29] [INFO ] Implicit Places using invariants in 460 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 465 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 15:21:29] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 15:21:29] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 15:21:29] [INFO ] Invariant cache hit.
[2023-03-09 15:21:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:31] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2089 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 2565 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1449 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 923 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 684736 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 684736 steps, saw 342443 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:21:34] [INFO ] Invariant cache hit.
[2023-03-09 15:21:34] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:21:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:21:34] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:21:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:21:35] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:35] [INFO ] After 155ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:35] [INFO ] After 196ms 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 15:21:35] [INFO ] After 413ms 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 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 6 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:21:35] [INFO ] Invariant cache hit.
[2023-03-09 15:21:35] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 15:21:35] [INFO ] Invariant cache hit.
[2023-03-09 15:21:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:37] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2023-03-09 15:21:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:21:37] [INFO ] Invariant cache hit.
[2023-03-09 15:21:37] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2271 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 13 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 15:21:37] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:21:37] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 15:21:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:21:37] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 15:21:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:21:37] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:21:37] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:37] [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 11 ms.
[2023-03-09 15:21:37] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 10000 steps, including 935 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665828 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665828 steps, saw 332985 distinct states, run finished after 3004 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:21:40] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:21:41] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:21:41] [INFO ] After 64ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:41] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:21:41] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:41] [INFO ] After 230ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:41] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-09 15:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 15:21:41] [INFO ] After 362ms 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 15:21:42] [INFO ] After 684ms 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 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 1451 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 684481 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 684481 steps, saw 342310 distinct states, run finished after 3002 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:21:45] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:21:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:45] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:21:45] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:45] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:45] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:21:45] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:21:45] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:45] [INFO ] After 156ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:45] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 1 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 0 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 1 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2023-03-09 15:21:48] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-09 15:21:48] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2023-03-09 15:21:48] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2605 ms
[2023-03-09 15:21:48] [INFO ] After 2788ms 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 15:21:48] [INFO ] After 3015ms 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 15:21:48] [INFO ] Invariant cache hit.
[2023-03-09 15:21:48] [INFO ] Implicit Places using invariants in 508 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 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 15:21:48] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 15:21:49] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-09 15:21:49] [INFO ] Invariant cache hit.
[2023-03-09 15:21:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:50] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1691 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 2218 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1442 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 931 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 687986 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687986 steps, saw 344067 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:21:53] [INFO ] Invariant cache hit.
[2023-03-09 15:21:53] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:21:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:21:53] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:21:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:21:54] [INFO ] After 251ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:54] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:21:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:21:54] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 15:21:54] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:54] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:21:54] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:21:54] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-09 15:21:54] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 0 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 0 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 1 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 0 ms to minimize.
[2023-03-09 15:21:56] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 1 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 0 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 0 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 1 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 0 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:21:58] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:22:00] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2023-03-09 15:22:00] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-03-09 15:22:00] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
[2023-03-09 15:22:00] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 5810 ms
[2023-03-09 15:22:00] [INFO ] After 5955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-09 15:22:00] [INFO ] After 6336ms 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:22:00] [INFO ] Invariant cache hit.
[2023-03-09 15:22:00] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-09 15:22:00] [INFO ] Invariant cache hit.
[2023-03-09 15:22:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:02] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-09 15:22:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:22:02] [INFO ] Invariant cache hit.
[2023-03-09 15:22:02] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2290 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 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 15:22:02] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:22:02] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:22:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:02] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:22:03] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:03] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 15:22:03] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:03] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:03] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-09 15:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 15:22:03] [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 10 ms.
[2023-03-09 15:22:03] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 895 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629115 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629115 steps, saw 314629 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:22:06] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:06] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:06] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:22:06] [INFO ] After 65ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:06] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:06] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:07] [INFO ] After 124ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:07] [INFO ] After 146ms 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 15:22:07] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 13 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1420 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 682325 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682325 steps, saw 341237 distinct states, run finished after 3004 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:22:10] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:10] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:22:10] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:10] [INFO ] After 134ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:10] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:22:10] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:10] [INFO ] After 94ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:10] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:22:10] [INFO ] After 342ms 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 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 15:22:10] [INFO ] Invariant cache hit.
[2023-03-09 15:22:11] [INFO ] Implicit Places using invariants in 505 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 506 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 15:22:11] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 15:22:11] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 15:22:11] [INFO ] Invariant cache hit.
[2023-03-09 15:22:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:13] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2314 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 2835 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 707934 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 707934 steps, saw 354053 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:22:16] [INFO ] Invariant cache hit.
[2023-03-09 15:22:16] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-09 15:22:16] [INFO ] [Real]Absence check using 6 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 15:22:16] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:16] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:16] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-09 15:22:17] [INFO ] [Nat]Absence check using 6 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 15:22:17] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:17] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:17] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 15:22:17] [INFO ] After 328ms 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 4 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 15:22:17] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 15:22:17] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:19] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2023-03-09 15:22:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:22:19] [INFO ] Invariant cache hit.
[2023-03-09 15:22:20] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2793 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 14 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 15:22:20] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 15:22:20] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-09 15:22:20] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:20] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:22:20] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:22:20] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 15:22:20] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1443 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 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659495 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659495 steps, saw 329824 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:22:23] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:22:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:23] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:23] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:22:23] [INFO ] After 36ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:22:23] [INFO ] After 58ms 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 15:22:23] [INFO ] After 293ms 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 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 12 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 13 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1495 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 876 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 686742 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686742 steps, saw 343450 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:22:26] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:26] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 15:22:26] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:27] [INFO ] After 112ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:27] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:27] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 15:22:27] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:27] [INFO ] After 98ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:27] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:22:27] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:22:27] [INFO ] Invariant cache hit.
[2023-03-09 15:22:27] [INFO ] Implicit Places using invariants in 374 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 375 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 15:22:27] [INFO ] Computed 33 place invariants in 11 ms
[2023-03-09 15:22:28] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-09 15:22:28] [INFO ] Invariant cache hit.
[2023-03-09 15:22:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:30] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2216 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 2603 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1469 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 694481 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694481 steps, saw 347316 distinct states, run finished after 3005 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:22:33] [INFO ] Invariant cache hit.
[2023-03-09 15:22:33] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:33] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:33] [INFO ] After 251ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:33] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:33] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:33] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:33] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:33] [INFO ] After 156ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:33] [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 15:22:33] [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 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 15:22:33] [INFO ] Invariant cache hit.
[2023-03-09 15:22:34] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 15:22:34] [INFO ] Invariant cache hit.
[2023-03-09 15:22:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:35] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2023-03-09 15:22:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:22:35] [INFO ] Invariant cache hit.
[2023-03-09 15:22:36] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2330 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 11 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 15:22:36] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-09 15:22:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 15:22:36] [INFO ] [Real]Absence check using 6 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:36] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:22:36] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:22:36] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 15:22:36] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1412 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 668127 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668127 steps, saw 334137 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:22:39] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:39] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:22:39] [INFO ] After 62ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:39] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:22:39] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:40] [INFO ] After 94ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2023-03-09 15:22:40] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:22:40] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-03-09 15:22:40] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:22:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2023-03-09 15:22:40] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-09 15:22:40] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 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 1427 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 705083 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 705083 steps, saw 352625 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:22:43] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:22:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:43] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 15:22:43] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:43] [INFO ] After 44ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:43] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:43] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:22:44] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:44] [INFO ] After 47ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:44] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 15:22:44] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 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 15:22:44] [INFO ] Invariant cache hit.
[2023-03-09 15:22:44] [INFO ] Implicit Places using invariants in 442 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 446 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 15:22:44] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:22:44] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-09 15:22:44] [INFO ] Invariant cache hit.
[2023-03-09 15:22:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:46] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1851 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 2309 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 904 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643003 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643003 steps, saw 321577 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:22:49] [INFO ] Invariant cache hit.
[2023-03-09 15:22:49] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:22:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:49] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:49] [INFO ] After 62ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:49] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:22:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:22:50] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:50] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:50] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 15:22:50] [INFO ] After 310ms 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 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:22:50] [INFO ] Invariant cache hit.
[2023-03-09 15:22:50] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-09 15:22:50] [INFO ] Invariant cache hit.
[2023-03-09 15:22:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22:52] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-09 15:22:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:22:52] [INFO ] Invariant cache hit.
[2023-03-09 15:22:52] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2325 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 15:22:52] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:22:52] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:22:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:52] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:22:52] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:22:52] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-09 15:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 15:22:52] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:52] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:22:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:22:53] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:53] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:22:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2023-03-09 15:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 15:22:53] [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 9 ms.
[2023-03-09 15:22:53] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1462 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 882 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667218 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667218 steps, saw 333683 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:22:56] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:22:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:56] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:22:56] [INFO ] After 57ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:22:56] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:22:56] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 14 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1460 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649671 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649671 steps, saw 324909 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 15:22:59] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:22:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:59] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 15:22:59] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:22:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:22: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 15:22:59] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:22:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:22:59] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 15:23:00] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:00] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:00] [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 15:23:00] [INFO ] After 306ms 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 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 15:23:00] [INFO ] Invariant cache hit.
[2023-03-09 15:23:00] [INFO ] Implicit Places using invariants in 310 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 312 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 15:23:00] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 15:23:00] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 15:23:00] [INFO ] Invariant cache hit.
[2023-03-09 15:23:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:02] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2463 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1436 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 922 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 696241 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 696241 steps, saw 348193 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:23:05] [INFO ] Invariant cache hit.
[2023-03-09 15:23:05] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 15:23:05] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:23:05] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:05] [INFO ] After 94ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:05] [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 15:23:05] [INFO ] After 349ms 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 15:23:05] [INFO ] Invariant cache hit.
[2023-03-09 15:23:06] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-09 15:23:06] [INFO ] Invariant cache hit.
[2023-03-09 15:23:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:08] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2023-03-09 15:23:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:23:08] [INFO ] Invariant cache hit.
[2023-03-09 15:23:08] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2347 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 12 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 15:23:08] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 15:23:08] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-09 15:23:08] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:08] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:23:08] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:08] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 15:23:08] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 911 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675899 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675899 steps, saw 338022 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:23:11] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:23:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:11] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:23:11] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:23:11] [INFO ] After 47ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:11] [INFO ] After 73ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:11] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:23:12] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:12] [INFO ] After 49ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:12] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 15:23:12] [INFO ] After 348ms 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 14 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1423 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 682981 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682981 steps, saw 341561 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:23:15] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 15:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:15] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 15:23:15] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:15] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:15] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:15] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:15] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 15:23:15] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:16] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:16] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 0 ms to minimize.
[2023-03-09 15:23:16] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-09 15:23:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2023-03-09 15:23:16] [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 14 ms.
[2023-03-09 15:23:16] [INFO ] After 667ms 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 15:23:16] [INFO ] Invariant cache hit.
[2023-03-09 15:23:16] [INFO ] Implicit Places using invariants in 491 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 493 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 8 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 15:23:16] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 15:23:17] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-09 15:23:17] [INFO ] Invariant cache hit.
[2023-03-09 15:23:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:18] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1972 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 2477 ms. Remains : 207/226 places, 213/219 transitions.
Incomplete random walk after 10000 steps, including 1411 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 911 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 692308 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 692308 steps, saw 346228 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:23:21] [INFO ] Invariant cache hit.
[2023-03-09 15:23:21] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:23:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:22] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:22] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:22] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:23:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:23:22] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:22] [INFO ] After 68ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:22] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2023-03-09 15:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-09 15:23:22] [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 27 ms.
[2023-03-09 15:23:22] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 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 3 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 15:23:22] [INFO ] Invariant cache hit.
[2023-03-09 15:23:22] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 15:23:22] [INFO ] Invariant cache hit.
[2023-03-09 15:23:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:24] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
[2023-03-09 15:23:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:23:24] [INFO ] Invariant cache hit.
[2023-03-09 15:23:24] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2097 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 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 15:23:24] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:23:24] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:23:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:25] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:23:25] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:25] [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 15 ms.
[2023-03-09 15:23:25] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1474 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 932 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 16 ms. (steps per millisecond=126 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 16 ms. (steps per millisecond=126 ) properties seen :1
Incomplete random walk after 10000 steps, including 1441 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 911 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654502 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654502 steps, saw 327323 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:23:28] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:23:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:23:28] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:28] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:23:28] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:23:28] [INFO ] After 27ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:28] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-09 15:23:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 15:23:28] [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 16 ms.
[2023-03-09 15:23:28] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652527 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652527 steps, saw 326334 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:23:31] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:23:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:23:31] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:23:32] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:32] [INFO ] After 74ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:32] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:23:32] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:23:32] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:32] [INFO ] After 131ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:32] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-09 15:23:32] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-09 15:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-09 15:23:32] [INFO ] After 383ms 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 15:23:32] [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 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 15:23:32] [INFO ] Invariant cache hit.
[2023-03-09 15:23:33] [INFO ] Implicit Places using invariants in 596 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 598 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 15:23:33] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 15:23:33] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-09 15:23:33] [INFO ] Invariant cache hit.
[2023-03-09 15:23:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:35] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 1981 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 2596 ms. Remains : 206/226 places, 212/219 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 10000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 721371 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 721371 steps, saw 360769 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:23:38] [INFO ] Invariant cache hit.
[2023-03-09 15:23:38] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:23:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:38] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:38] [INFO ] After 74ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:38] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:23:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:23:38] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:39] [INFO ] After 90ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:39] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2023-03-09 15:23:39] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-09 15:23:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-09 15:23:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2023-03-09 15:23:39] [INFO ] After 391ms 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 15:23:39] [INFO ] After 617ms 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 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 15:23:39] [INFO ] Invariant cache hit.
[2023-03-09 15:23:39] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 15:23:39] [INFO ] Invariant cache hit.
[2023-03-09 15:23:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:41] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
[2023-03-09 15:23:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:23:41] [INFO ] Invariant cache hit.
[2023-03-09 15:23:41] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2500 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 15:23:41] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:23:41] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 15:23:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:23:42] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:23:42] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:42] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-09 15:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-09 15:23:42] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:42] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 15:23:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:42] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:42] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:42] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-09 15:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 15:23:42] [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 15:23:42] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1465 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 627354 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627354 steps, saw 313749 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 15:23:45] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:23:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:23:45] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:23:45] [INFO ] After 75ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:45] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:23:46] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:46] [INFO ] After 97ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:46] [INFO ] After 120ms 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 15:23:46] [INFO ] After 381ms 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 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 1461 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 679379 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679379 steps, saw 339762 distinct states, run finished after 3004 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:23:49] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:23:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 15:23:49] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:23:49] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:49] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:49] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:23:49] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 15:23:49] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:49] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:50] [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 15:23:50] [INFO ] After 424ms 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 15:23:50] [INFO ] Invariant cache hit.
[2023-03-09 15:23:50] [INFO ] Implicit Places using invariants in 547 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 549 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 15:23:50] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 15:23:50] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-09 15:23:50] [INFO ] Invariant cache hit.
[2023-03-09 15:23:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:52] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2003 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 2569 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 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 682163 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682163 steps, saw 341157 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:23:55] [INFO ] Invariant cache hit.
[2023-03-09 15:23:55] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:23:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:55] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:55] [INFO ] After 145ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:55] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:23:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:23:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:23:56] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:56] [INFO ] After 53ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:23:56] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 15:23:56] [INFO ] After 296ms 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:23:56] [INFO ] Invariant cache hit.
[2023-03-09 15:23:56] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 15:23:56] [INFO ] Invariant cache hit.
[2023-03-09 15:23:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:23:58] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 2695 ms to find 0 implicit places.
[2023-03-09 15:23:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:23:59] [INFO ] Invariant cache hit.
[2023-03-09 15:23:59] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2937 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 14 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 15:23:59] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 15:23:59] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:23:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:23:59] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:23:59] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:23:59] [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 15:23:59] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1461 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 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625078 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625078 steps, saw 312611 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:24:02] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:24:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:02] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:24:02] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:02] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:24:03] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:24:03] [INFO ] After 85ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:03] [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 15 ms.
[2023-03-09 15:24:03] [INFO ] After 368ms 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 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 1445 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 907 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644327 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644327 steps, saw 322234 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:24:06] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:24:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:24:06] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:24:06] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:06] [INFO ] After 193ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:06] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:24:06] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:24:06] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:06] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:06] [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 13 ms.
[2023-03-09 15:24:06] [INFO ] After 314ms 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 15:24:06] [INFO ] Invariant cache hit.
[2023-03-09 15:24:07] [INFO ] Implicit Places using invariants in 511 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 512 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 15:24:07] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:24:07] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 15:24:07] [INFO ] Invariant cache hit.
[2023-03-09 15:24:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:09] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1868 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 2394 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1435 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 645949 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645949 steps, saw 323046 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:24:12] [INFO ] Invariant cache hit.
[2023-03-09 15:24:12] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:24:12] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:24:12] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:12] [INFO ] After 187ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:12] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:24:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:24:13] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:13] [INFO ] After 56ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:13] [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 13 ms.
[2023-03-09 15:24:13] [INFO ] After 366ms 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:24:13] [INFO ] Invariant cache hit.
[2023-03-09 15:24:13] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-09 15:24:13] [INFO ] Invariant cache hit.
[2023-03-09 15:24:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:14] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2023-03-09 15:24:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:24:14] [INFO ] Invariant cache hit.
[2023-03-09 15:24:15] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1976 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 15:24:15] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:24:15] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 15:24:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:24:15] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:24:15] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:24:15] [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 15:24:15] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642218 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642218 steps, saw 321180 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:24:18] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:24:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:18] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:24:18] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:24:18] [INFO ] After 58ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:18] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:18] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:24:18] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:19] [INFO ] After 49ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:19] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:24:19] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 83 place count 227 transition count 220
Applied a total of 83 rules in 15 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 227/255 places, 220/248 transitions.
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 907 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 690370 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 690370 steps, saw 345257 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:24:22] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:24:22] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-09 15:24:22] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 15 ms returned sat
[2023-03-09 15:24:22] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-09 15:24:22] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 19 ms returned sat
[2023-03-09 15:24:22] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:22] [INFO ] After 149ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:22] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-09 15:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-09 15:24:22] [INFO ] After 289ms 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 15:24:22] [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 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 15:24:22] [INFO ] Invariant cache hit.
[2023-03-09 15:24:23] [INFO ] Implicit Places using invariants in 558 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 559 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 15 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 15:24:23] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 15:24:23] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-09 15:24:23] [INFO ] Invariant cache hit.
[2023-03-09 15:24:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:25] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2234 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 2814 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 594080 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 594080 steps, saw 297107 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:24:28] [INFO ] Invariant cache hit.
[2023-03-09 15:24:28] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:24:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:24:29] [INFO ] After 214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:29] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:29] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-09 15:24:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:24:29] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:29] [INFO ] After 195ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:29] [INFO ] After 227ms 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 15:24:29] [INFO ] After 578ms 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 7 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:24:29] [INFO ] Invariant cache hit.
[2023-03-09 15:24:30] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-09 15:24:30] [INFO ] Invariant cache hit.
[2023-03-09 15:24:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:32] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2023-03-09 15:24:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:24:32] [INFO ] Invariant cache hit.
[2023-03-09 15:24:32] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3018 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 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 15:24:32] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:24:32] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:24:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:24:32] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:24:32] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:32] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 15:24:33] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:24:33] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:33] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:24:33] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-09 15:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-09 15:24:33] [INFO ] After 284ms 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 15:24:33] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596942 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596942 steps, saw 298533 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:24:36] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:24:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:36] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 15:24:36] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:24:36] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 15:24:37] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:24:37] [INFO ] After 237ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:37] [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 42 ms.
[2023-03-09 15:24:37] [INFO ] After 600ms 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 17 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 17 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1489 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 902 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635653 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635653 steps, saw 317902 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:24:40] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:24:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:24:40] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:24:40] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:40] [INFO ] After 77ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:40] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:24:40] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:24:41] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:41] [INFO ] After 88ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:41] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-09 15:24:41] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:24:41] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-09 15:24:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2023-03-09 15:24:41] [INFO ] After 396ms 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 15:24:41] [INFO ] After 687ms 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 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 15:24:41] [INFO ] Invariant cache hit.
[2023-03-09 15:24:42] [INFO ] Implicit Places using invariants in 519 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 520 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 15:24:42] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 15:24:42] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 15:24:42] [INFO ] Invariant cache hit.
[2023-03-09 15:24:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:44] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 2549 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 3082 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 687077 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 687077 steps, saw 343613 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:24:47] [INFO ] Invariant cache hit.
[2023-03-09 15:24:47] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:24:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:24:48] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:24:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-09 15:24:48] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:48] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:48] [INFO ] After 145ms 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 15:24:48] [INFO ] After 517ms 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 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 15:24:48] [INFO ] Invariant cache hit.
[2023-03-09 15:24:48] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 15:24:48] [INFO ] Invariant cache hit.
[2023-03-09 15:24:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:51] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2023-03-09 15:24:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:24:51] [INFO ] Invariant cache hit.
[2023-03-09 15:24:51] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2885 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 19 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 15:24:51] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 15:24:51] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 15:24:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:24:51] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 15:24:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:24:52] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:24:52] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:52] [INFO ] After 45ms 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 15:24:52] [INFO ] After 405ms 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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 603814 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603814 steps, saw 301968 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:24:55] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:24:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:24:55] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:24:55] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:24:55] [INFO ] After 138ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:24:55] [INFO ] After 176ms 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 15:24:55] [INFO ] After 413ms 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 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 27 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 28 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1471 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 889 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608521 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608521 steps, saw 304322 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:24:58] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 15:24:58] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-09 15:24:58] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-09 15:24:58] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 15:24:59] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 20 ms returned sat
[2023-03-09 15:24:59] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:24:59] [INFO ] After 152ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:59] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 15:24:59] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 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 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 15:24:59] [INFO ] Invariant cache hit.
[2023-03-09 15:25:00] [INFO ] Implicit Places using invariants in 684 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 685 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 15:25:00] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:25:00] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-09 15:25:00] [INFO ] Invariant cache hit.
[2023-03-09 15:25:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:03] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 3400 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 4104 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624558 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624558 steps, saw 312350 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:25:06] [INFO ] Invariant cache hit.
[2023-03-09 15:25:06] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:25:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:25:06] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:06] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:06] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:25:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:25:07] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:07] [INFO ] After 49ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:07] [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 15 ms.
[2023-03-09 15:25:07] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 15:25:07] [INFO ] Invariant cache hit.
[2023-03-09 15:25:07] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-09 15:25:07] [INFO ] Invariant cache hit.
[2023-03-09 15:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:09] [INFO ] Implicit Places using invariants and state equation in 2258 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
[2023-03-09 15:25:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:25:09] [INFO ] Invariant cache hit.
[2023-03-09 15:25:10] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2960 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 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 15:25:10] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 15:25:10] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:25:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:25:10] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:25:10] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:10] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-09 15:25:10] [INFO ] After 145ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:10] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:25:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:25:10] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:10] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:10] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:25:11] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-09 15:25:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-09 15:25:11] [INFO ] After 262ms 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 15:25:11] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1422 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 917 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612899 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612899 steps, saw 306516 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 15:25:14] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 15:25:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:25:14] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:25:14] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:25:14] [INFO ] After 203ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:14] [INFO ] After 238ms 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 15:25:14] [INFO ] After 482ms 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 22 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1417 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 915 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 599906 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599906 steps, saw 300014 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:25:17] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:25:17] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-09 15:25:17] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:18] [INFO ] After 77ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:18] [INFO ] After 112ms 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 15:25:18] [INFO ] After 420ms 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 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 15:25:18] [INFO ] Invariant cache hit.
[2023-03-09 15:25:18] [INFO ] Implicit Places using invariants in 700 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 705 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 13 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 15:25:18] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:25:19] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-09 15:25:19] [INFO ] Invariant cache hit.
[2023-03-09 15:25:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:21] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2614 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 3341 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1436 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 905 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613205 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613205 steps, saw 306666 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:25:24] [INFO ] Invariant cache hit.
[2023-03-09 15:25:24] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 15:25:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:25:24] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:24] [INFO ] After 44ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:24] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2023-03-09 15:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 15:25:24] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:24] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 15:25:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:25:25] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:25] [INFO ] After 163ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:25] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-09 15:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-09 15:25:25] [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 15:25:25] [INFO ] After 669ms 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 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 15:25:25] [INFO ] Invariant cache hit.
[2023-03-09 15:25:26] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-09 15:25:26] [INFO ] Invariant cache hit.
[2023-03-09 15:25:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:28] [INFO ] Implicit Places using invariants and state equation in 2922 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2023-03-09 15:25:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:25:28] [INFO ] Invariant cache hit.
[2023-03-09 15:25:29] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3625 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 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 15:25:29] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 15:25:29] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:25:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:25:29] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:25:29] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:29] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:25:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:25:29] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:29] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:29] [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 15 ms.
[2023-03-09 15:25:29] [INFO ] After 332ms 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 22 ms. (steps per millisecond=454 ) 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 567606 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567606 steps, saw 283863 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:25:32] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 15:25:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:25:32] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:25:33] [INFO ] After 351ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:33] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:25:33] [INFO ] After 110ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:33] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2023-03-09 15:25:33] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-09 15:25:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2023-03-09 15:25:33] [INFO ] After 423ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:33] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:25:33] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 15:25:34] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:34] [INFO ] After 100ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-09 15:25:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 694 ms
[2023-03-09 15:25:35] [INFO ] After 814ms 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 15:25:35] [INFO ] After 1295ms 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 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 1411 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 921 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617172 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617172 steps, saw 308658 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:25:38] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-09 15:25:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:25:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-09 15:25:38] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:38] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:38] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:25:38] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 15:25:38] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:39] [INFO ] After 126ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-09 15:25:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2023-03-09 15:25:39] [INFO ] After 596ms 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 15:25:39] [INFO ] After 956ms 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 15:25:39] [INFO ] Invariant cache hit.
[2023-03-09 15:25:40] [INFO ] Implicit Places using invariants in 708 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 709 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 15:25:40] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 15:25:40] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-09 15:25:40] [INFO ] Invariant cache hit.
[2023-03-09 15:25:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:42] [INFO ] Implicit Places using invariants and state equation in 2184 ms returned []
Implicit Place search using SMT with State Equation took 2611 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 3338 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602313 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602313 steps, saw 301221 distinct states, run finished after 3004 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:25:45] [INFO ] Invariant cache hit.
[2023-03-09 15:25:45] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:25:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:25:46] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:46] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:46] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:25:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:25:46] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:46] [INFO ] After 227ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:46] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:25:46] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-09 15:25:47] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-09 15:25:47] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-09 15:25:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 516 ms
[2023-03-09 15:25:47] [INFO ] After 764ms 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 15:25:47] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 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 15:25:47] [INFO ] Invariant cache hit.
[2023-03-09 15:25:47] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-09 15:25:47] [INFO ] Invariant cache hit.
[2023-03-09 15:25:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:50] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3017 ms to find 0 implicit places.
[2023-03-09 15:25:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:25:50] [INFO ] Invariant cache hit.
[2023-03-09 15:25:50] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3337 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 15:25:50] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 15:25:50] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 15:25:50] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:25:50] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:25:50] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:50] [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 15:25:50] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1411 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 918 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 592791 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 592791 steps, saw 296462 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 15:25:54] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-09 15:25:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:25:54] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:25:54] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:25:54] [INFO ] After 158ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:54] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:25:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:25:54] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 15:25:54] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:55] [INFO ] After 196ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:25:55] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 15:25:55] [INFO ] After 590ms 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 21 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1462 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 916 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625158 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625158 steps, saw 312650 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 15:25:58] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:25:58] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-09 15:25:58] [INFO ] [Real]Absence check using 6 positive and 38 generalized place invariants in 33 ms returned sat
[2023-03-09 15:25:58] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:25:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:25:58] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:25:58] [INFO ] After 114ms 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 15:25:58] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 15:25:58] [INFO ] Invariant cache hit.
[2023-03-09 15:25:59] [INFO ] Implicit Places using invariants in 629 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 645 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 12 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 15:25:59] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:25:59] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-09 15:25:59] [INFO ] Invariant cache hit.
[2023-03-09 15:25:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:01] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 2563 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 3226 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1439 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647982 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647982 steps, saw 324064 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:26:04] [INFO ] Invariant cache hit.
[2023-03-09 15:26:04] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:26:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:26:04] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:05] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:05] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 15:26:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:26:05] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:05] [INFO ] After 140ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:05] [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 17 ms.
[2023-03-09 15:26:05] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 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 15:26:05] [INFO ] Invariant cache hit.
[2023-03-09 15:26:05] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 15:26:05] [INFO ] Invariant cache hit.
[2023-03-09 15:26:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:07] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2023-03-09 15:26:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:26:07] [INFO ] Invariant cache hit.
[2023-03-09 15:26:07] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2416 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 13 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 15:26:07] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 15:26:07] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:26:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:26:08] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:26:08] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:26:08] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:08] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 15:26:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:26:08] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:08] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:08] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-09 15:26:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-03-09 15:26:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-09 15:26:08] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2023-03-09 15:26:08] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2023-03-09 15:26:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 344 ms
[2023-03-09 15:26:08] [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 10 ms.
[2023-03-09 15:26:08] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 665435 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665435 steps, saw 332791 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:26:11] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:26:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:26:11] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:26:11] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:26:11] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:26:12] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-09 15:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 15:26:12] [INFO ] After 135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:12] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:26:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:26:12] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:12] [INFO ] After 48ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:12] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2023-03-09 15:26:12] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-09 15:26:12] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2023-03-09 15:26:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-03-09 15:26:12] [INFO ] After 312ms 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 15:26:12] [INFO ] After 576ms 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 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 13 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 679664 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679664 steps, saw 339904 distinct states, run finished after 3004 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:26:15] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:26:15] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 15:26:15] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 15:26:15] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:16] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:16] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 15:26:16] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-09 15:26:16] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:16] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:16] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-09 15:26:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2023-03-09 15:26:16] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 15:26:16] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2023-03-09 15:26:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 388 ms
[2023-03-09 15:26:16] [INFO ] After 516ms 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 15:26:16] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 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 15:26:16] [INFO ] Invariant cache hit.
[2023-03-09 15:26:17] [INFO ] Implicit Places using invariants in 475 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 476 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 11 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 15:26:17] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 15:26:17] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 15:26:17] [INFO ] Invariant cache hit.
[2023-03-09 15:26:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:19] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1942 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 2434 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 926 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 685540 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685540 steps, saw 342849 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:26:22] [INFO ] Invariant cache hit.
[2023-03-09 15:26:22] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:26:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 15:26:22] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:22] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:22] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:26:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:26:22] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:22] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:22] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-09 15:26:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-09 15:26:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-09 15:26:23] [INFO ] After 246ms 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 15:26:23] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 15:26:23] [INFO ] Invariant cache hit.
[2023-03-09 15:26:23] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 15:26:23] [INFO ] Invariant cache hit.
[2023-03-09 15:26:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:24] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1738 ms to find 0 implicit places.
[2023-03-09 15:26:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:26:24] [INFO ] Invariant cache hit.
[2023-03-09 15:26:25] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2060 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 1 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 15:26:25] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 15:26:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:26:25] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-09 15:26:25] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:26:25] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:26:25] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-09 15:26:25] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-09 15:26:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-09 15:26:25] [INFO ] After 174ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:25] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-09 15:26:25] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:25] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:25] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-09 15:26:25] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 15:26:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-09 15:26:25] [INFO ] After 197ms 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 15:26:25] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1450 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 937 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642731 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642731 steps, saw 321439 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:26:29] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:29] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:26:29] [INFO ] After 179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:26:29] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:29] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:26:29] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:26:29] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:29] [INFO ] After 36ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:29] [INFO ] After 58ms 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 15:26:29] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 15 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1476 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 680072 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 680072 steps, saw 340106 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:26:32] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 15:26:32] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-09 15:26:32] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 15:26:32] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26: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 15:26:33] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-09 15:26:33] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 15:26:33] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:33] [INFO ] After 150ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:33] [INFO ] After 173ms 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 15:26:33] [INFO ] After 418ms 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 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 15:26:33] [INFO ] Invariant cache hit.
[2023-03-09 15:26:33] [INFO ] Implicit Places using invariants in 390 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 393 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 17 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 15:26:33] [INFO ] Computed 32 place invariants in 15 ms
[2023-03-09 15:26:34] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-09 15:26:34] [INFO ] Invariant cache hit.
[2023-03-09 15:26:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:35] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1791 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 2207 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1442 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 696465 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 696465 steps, saw 348304 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:26:38] [INFO ] Invariant cache hit.
[2023-03-09 15:26:38] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-09 15:26:38] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:26:38] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:39] [INFO ] After 119ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:39] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 15:26:39] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:26:39] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:39] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:39] [INFO ] After 140ms 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 15:26:39] [INFO ] After 376ms 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 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 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 15:26:39] [INFO ] Invariant cache hit.
[2023-03-09 15:26:39] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-09 15:26:39] [INFO ] Invariant cache hit.
[2023-03-09 15:26:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:41] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2023-03-09 15:26:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:26:41] [INFO ] Invariant cache hit.
[2023-03-09 15:26:41] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2176 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 15:26:41] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 15:26:41] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 15:26:41] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 15:26:41] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:26:41] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:26:41] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-09 15:26:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 15:26:41] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:41] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 15:26:42] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:26:42] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:42] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:42] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-09 15:26:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-09 15:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-09 15:26:42] [INFO ] After 212ms 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 15:26:42] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 880 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 585873 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 585873 steps, saw 292998 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:26:45] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:26:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 15:26:45] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:26:45] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:26:46] [INFO ] After 107ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:46] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-09 15:26:46] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 20 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1425 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 944 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 692214 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 692214 steps, saw 346181 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:26:49] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:49] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 15:26:49] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:26:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:49] [INFO ] After 151ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:49] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:26:49] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-09 15:26:50] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:50] [INFO ] After 184ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:50] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2023-03-09 15:26:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-09 15:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-09 15:26:50] [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 29 ms.
[2023-03-09 15:26:50] [INFO ] After 872ms 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 15:26:50] [INFO ] Invariant cache hit.
[2023-03-09 15:26:51] [INFO ] Implicit Places using invariants in 673 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 674 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 15:26:51] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 15:26:51] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-09 15:26:51] [INFO ] Invariant cache hit.
[2023-03-09 15:26:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:53] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 2409 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 3101 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675810 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675810 steps, saw 337976 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:26:56] [INFO ] Invariant cache hit.
[2023-03-09 15:26:56] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:26:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:26:57] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:26:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 15:26:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:26:57] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:26:57] [INFO ] After 108ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:26:57] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-09 15:26:57] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-09 15:26:58] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-09 15:26:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-09 15:26:58] [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 43 ms.
[2023-03-09 15:26:58] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 15:26:58] [INFO ] Invariant cache hit.
[2023-03-09 15:26:58] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-09 15:26:58] [INFO ] Invariant cache hit.
[2023-03-09 15:26:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:00] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
[2023-03-09 15:27:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:27:00] [INFO ] Invariant cache hit.
[2023-03-09 15:27:01] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3152 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 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 15:27:01] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-09 15:27:01] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 15:27:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:27:01] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 15:27:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 15:27:01] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:27:01] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:01] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2023-03-09 15:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 15:27:02] [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 31 ms.
[2023-03-09 15:27:02] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1472 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 927 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617249 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617249 steps, saw 308696 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 15:27:05] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:27:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:27:05] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:27:05] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:27:05] [INFO ] After 124ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:05] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:05] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:27:05] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:06] [INFO ] After 331ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:06] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-09 15:27:06] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-09 15:27:06] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-09 15:27:06] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-09 15:27:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 428 ms
[2023-03-09 15:27:06] [INFO ] After 826ms 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 15:27:06] [INFO ] After 1221ms 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 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 24 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1443 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 911 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647884 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647884 steps, saw 324013 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 15:27:09] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:27:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:27:09] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:27:10] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:10] [INFO ] After 104ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:10] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:27:10] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-09 15:27:10] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:10] [INFO ] After 142ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:10] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:27:11] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 0 ms to minimize.
[2023-03-09 15:27:11] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 1 ms to minimize.
[2023-03-09 15:27:11] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:27:11] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 0 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 1 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 0 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3005 ms
[2023-03-09 15:27:13] [INFO ] After 3173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-09 15:27:13] [INFO ] After 3559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 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 15:27:13] [INFO ] Invariant cache hit.
[2023-03-09 15:27:14] [INFO ] Implicit Places using invariants in 704 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 706 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 15:27:14] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 15:27:14] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-09 15:27:14] [INFO ] Invariant cache hit.
[2023-03-09 15:27:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:17] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2576 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 3300 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653576 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653576 steps, saw 326858 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:27:20] [INFO ] Invariant cache hit.
[2023-03-09 15:27:20] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 15:27:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 15:27:20] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:20] [INFO ] After 125ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:20] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 15:27:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-09 15:27:20] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:20] [INFO ] After 280ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2023-03-09 15:27:21] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-09 15:27:21] [INFO ] After 961ms 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 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 15:27:21] [INFO ] Invariant cache hit.
[2023-03-09 15:27:21] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-09 15:27:21] [INFO ] Invariant cache hit.
[2023-03-09 15:27:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:23] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2595 ms to find 0 implicit places.
[2023-03-09 15:27:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:27:23] [INFO ] Invariant cache hit.
[2023-03-09 15:27:24] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2882 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 17 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 15:27:24] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 15:27:24] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 15:27:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:27:24] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:27:24] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:24] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 15:27:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:27:24] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:24] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:24] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-09 15:27:25] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-09 15:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-09 15:27:25] [INFO ] After 268ms 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 15:27:25] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1469 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 613947 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613947 steps, saw 307048 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 15:27:28] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:27:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:27:28] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:27:28] [INFO ] After 87ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:28] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:28] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 15:27:28] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:28] [INFO ] After 115ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:28] [INFO ] After 145ms 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 15:27:28] [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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 16 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1411 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 909 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642792 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642792 steps, saw 321470 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 15:27:32] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 15:27:32] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 15:27:32] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 15:27:32] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:32] [INFO ] After 162ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:32] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2023-03-09 15:27:32] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-09 15:27:32] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:32] [INFO ] After 137ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:32] [INFO ] After 170ms 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 15:27:32] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 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 15:27:33] [INFO ] Invariant cache hit.
[2023-03-09 15:27:33] [INFO ] Implicit Places using invariants in 601 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 602 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 15:27:33] [INFO ] Computed 32 place invariants in 15 ms
[2023-03-09 15:27:34] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-09 15:27:34] [INFO ] Invariant cache hit.
[2023-03-09 15:27:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:36] [INFO ] Implicit Places using invariants and state equation in 2264 ms returned []
Implicit Place search using SMT with State Equation took 2665 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 3290 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667424 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667424 steps, saw 333788 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:27:39] [INFO ] Invariant cache hit.
[2023-03-09 15:27:39] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-09 15:27:39] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-09 15:27:39] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:39] [INFO ] After 55ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:27:39] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 15:27:39] [INFO ] After 302ms 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 15:27:39] [INFO ] Invariant cache hit.
[2023-03-09 15:27:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-09 15:27:39] [INFO ] Invariant cache hit.
[2023-03-09 15:27:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:42] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
[2023-03-09 15:27:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:27:42] [INFO ] Invariant cache hit.
[2023-03-09 15:27:42] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2931 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 21 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 15:27:42] [INFO ] Computed 32 place invariants in 16 ms
[2023-03-09 15:27:42] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 15:27:42] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:27:42] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:27:42] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:27:42] [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 15:27:42] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1412 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 902 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 607105 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607105 steps, saw 303616 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 15:27:45] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 15:27:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:46] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 15:27:46] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:27:46] [INFO ] After 63ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:46] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:46] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 15:27:46] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:46] [INFO ] After 126ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:46] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-09 15:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-09 15:27:46] [INFO ] After 279ms 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 15:27:46] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 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 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1454 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 893 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622081 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622081 steps, saw 311114 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 15:27:49] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 15:27:50] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 15:27:50] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-09 15:27:50] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:50] [INFO ] After 99ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:50] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-09 15:27:50] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 28 ms returned sat
[2023-03-09 15:27:50] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:50] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:50] [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 20 ms.
[2023-03-09 15:27:50] [INFO ] After 536ms 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 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 15:27:50] [INFO ] Invariant cache hit.
[2023-03-09 15:27:51] [INFO ] Implicit Places using invariants in 511 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 513 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 12 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 15:27:51] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-09 15:27:51] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-09 15:27:51] [INFO ] Invariant cache hit.
[2023-03-09 15:27:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:54] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2736 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 3268 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647151 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647151 steps, saw 323650 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:27:57] [INFO ] Invariant cache hit.
[2023-03-09 15:27:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 15:27:57] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 15:27:57] [INFO ] After 179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:27:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:27:57] [INFO ] After 209ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:57] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:27:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:27:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-09 15:27:58] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:58] [INFO ] After 387ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:27:58] [INFO ] After 408ms 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 15:27:58] [INFO ] After 767ms 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 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 15:27:58] [INFO ] Invariant cache hit.
[2023-03-09 15:27:58] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 15:27:58] [INFO ] Invariant cache hit.
[2023-03-09 15:27:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:28:01] [INFO ] Implicit Places using invariants and state equation in 2979 ms returned []
Implicit Place search using SMT with State Equation took 3240 ms to find 0 implicit places.
[2023-03-09 15:28:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:28:01] [INFO ] Invariant cache hit.
[2023-03-09 15:28:01] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3448 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 20 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 15:28:01] [INFO ] Computed 33 place invariants in 19 ms
[2023-03-09 15:28:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-09 15:28:02] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 15:28:02] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:28:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 15:28:02] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:28:02] [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 15:28:02] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1408 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 914 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634530 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634530 steps, saw 317336 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 15:28:05] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 15:28:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:28:05] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 15:28:05] [INFO ] After 274ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:28:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 15:28:05] [INFO ] After 117ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:28:05] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 15:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-09 15:28:06] [INFO ] After 268ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:06] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:28:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 15:28:06] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:06] [INFO ] After 106ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:06] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 15:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-09 15:28:06] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-09 15:28:06] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 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 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 1412 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 922 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649372 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649372 steps, saw 324760 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 15:28:09] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 15:28:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:28:09] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:28:10] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:28:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:28:10] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 15:28:10] [INFO ] After 123ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:10] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:28:10] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 15:28:10] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:10] [INFO ] After 333ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:10] [INFO ] After 434ms 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 15:28:10] [INFO ] After 712ms 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 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 15:28:10] [INFO ] Invariant cache hit.
[2023-03-09 15:28:11] [INFO ] Implicit Places using invariants in 634 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 634 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 15:28:11] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 15:28:11] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-09 15:28:11] [INFO ] Invariant cache hit.
[2023-03-09 15:28:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:28:14] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2503 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 3156 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 640517 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640517 steps, saw 320331 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:28:17] [INFO ] Invariant cache hit.
[2023-03-09 15:28:17] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 15:28:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 15:28:17] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:28:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:28:17] [INFO ] After 131ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:17] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:28:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 15:28:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 15:28:17] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:18] [INFO ] After 463ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:28:18] [INFO ] After 493ms 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 15:28:18] [INFO ] After 874ms 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 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 15:28:18] [INFO ] Invariant cache hit.
[2023-03-09 15:28:18] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-09 15:28:18] [INFO ] Invariant cache hit.
[2023-03-09 15:28:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 15:28:20] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
[2023-03-09 15:28:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:28:20] [INFO ] Invariant cache hit.
[2023-03-09 15:28:20] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 19 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 15:28:21] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 15:28:21] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 15:28:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13326324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16166848 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
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 lolaxred"
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 r149-smll-167819435900297"
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 ;