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.r281-smll-167863551100394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Peterson-PT-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863551100394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 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 Liveness

=== Now, execution of the tool begins

BK_START 1678927407449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-5
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 00:43:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-16 00:43:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:43:30] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-16 00:43:30] [INFO ] Transformed 834 places.
[2023-03-16 00:43:30] [INFO ] Transformed 1242 transitions.
[2023-03-16 00:43:30] [INFO ] Found NUPN structural information;
[2023-03-16 00:43:30] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-16 00:43:30] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 281 ms.
Built sparse matrix representations for Structural reductions in 13 ms.25740KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 93 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 93 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-16 00:43:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-16 00:43:30] [INFO ] Computed 23 place invariants in 44 ms
[2023-03-16 00:43:31] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-16 00:43:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-16 00:43:31] [INFO ] Invariant cache hit.
[2023-03-16 00:43:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:43:32] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2023-03-16 00:43:32] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-16 00:43:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-16 00:43:32] [INFO ] Invariant cache hit.
[2023-03-16 00:43:33] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3255 ms. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2523 ms (no deadlock found). (steps per millisecond=495 )
Random directed walk for 1250000 steps, including 0 resets, run took 2988 ms (no deadlock found). (steps per millisecond=418 )
[2023-03-16 00:43:39] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-16 00:43:39] [INFO ] Invariant cache hit.
[2023-03-16 00:43:39] [INFO ] [Real]Absence check using 17 positive place invariants in 44 ms returned sat
[2023-03-16 00:43:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 38 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 63 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2023-03-16 00:43:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-03-16 00:43:39] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:43:40] [INFO ] Implicit Places using invariants in 305 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 377 ms. Remains : 258/834 places, 672/1242 transitions.
Discarding 6 transitions out of 672. Remains 666
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1007 ms. (steps per millisecond=9 ) properties (out of 666) seen :306
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 360) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 358) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 358) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 357) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 355) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Running SMT prover for 353 properties.
[2023-03-16 00:43:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 00:43:41] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-16 00:43:43] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 00:43:54] [INFO ] After 12973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:353
[2023-03-16 00:43:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 00:44:09] [INFO ] After 10452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :353
[2023-03-16 00:44:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:44:19] [INFO ] After 10046ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :353
[2023-03-16 00:44:19] [INFO ] After 10048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :353
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-16 00:44:19] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :353
Fused 353 Parikh solutions to 340 different solutions.
Parikh walk visited 29 properties in 7246 ms.
Support contains 213 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 556659 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 274) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 269) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 262) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 248) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 237) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 230) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 224) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 215) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 209) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 209) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 209) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 209) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 209) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 208) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 207) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 206) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 205) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 204) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 203) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 202) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Running SMT prover for 201 properties.
[2023-03-16 00:45:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:45:08] [INFO ] Invariant cache hit.
[2023-03-16 00:45:10] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:45:18] [INFO ] After 6703ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15 real:186
[2023-03-16 00:45:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:45:19] [INFO ] After 621ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:201
[2023-03-16 00:45:19] [INFO ] After 10963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:201
[2023-03-16 00:45:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:45:29] [INFO ] After 5978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :201
[2023-03-16 00:45:35] [INFO ] After 6527ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :201
[2023-03-16 00:45:36] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 9 ms to minimize.
[2023-03-16 00:45:36] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 2 ms to minimize.
[2023-03-16 00:45:36] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 2 ms to minimize.
[2023-03-16 00:45:36] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 5 ms to minimize.
[2023-03-16 00:45:37] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 2 ms to minimize.
[2023-03-16 00:45:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1520 ms
[2023-03-16 00:45:37] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 2 ms to minimize.
[2023-03-16 00:45:37] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-16 00:45:38] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2023-03-16 00:45:38] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 1 ms to minimize.
[2023-03-16 00:45:38] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-16 00:45:38] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1522 ms
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-16 00:45:39] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:45:40] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:45:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1054 ms
[2023-03-16 00:45:40] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-16 00:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-16 00:45:40] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 0 ms to minimize.
[2023-03-16 00:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-16 00:45:40] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:45:41] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:45:41] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2023-03-16 00:45:41] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 1 ms to minimize.
[2023-03-16 00:45:41] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2023-03-16 00:45:41] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2023-03-16 00:45:42] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:45:42] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:45:42] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:45:42] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:45:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2289 ms
[2023-03-16 00:45:43] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2023-03-16 00:45:43] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:45:43] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:45:43] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:45:43] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:45:44] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 1 ms to minimize.
[2023-03-16 00:45:44] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:45:44] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 1 ms to minimize.
[2023-03-16 00:45:44] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:45:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1815 ms
[2023-03-16 00:45:45] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2023-03-16 00:45:45] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-16 00:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-16 00:45:45] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:45:45] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2023-03-16 00:45:46] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2023-03-16 00:45:46] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 1 ms to minimize.
[2023-03-16 00:45:46] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:45:46] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 2 ms to minimize.
[2023-03-16 00:45:47] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2023-03-16 00:45:47] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2023-03-16 00:45:47] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 0 ms to minimize.
[2023-03-16 00:45:47] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:45:48] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 0 ms to minimize.
[2023-03-16 00:45:48] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 0 ms to minimize.
[2023-03-16 00:45:48] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 0 ms to minimize.
[2023-03-16 00:45:48] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:45:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3576 ms
[2023-03-16 00:45:49] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:49] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2023-03-16 00:45:49] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:49] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:45:49] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-16 00:45:50] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:45:50] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:45:50] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:45:50] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:45:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1797 ms
[2023-03-16 00:45:51] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 1 ms to minimize.
[2023-03-16 00:45:51] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 4 ms to minimize.
[2023-03-16 00:45:51] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:45:51] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
[2023-03-16 00:45:52] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 4 ms to minimize.
[2023-03-16 00:45:52] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2023-03-16 00:45:52] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-16 00:45:52] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-16 00:45:53] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-16 00:45:53] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2023-03-16 00:45:53] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:45:53] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:45:54] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:45:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3343 ms
[2023-03-16 00:45:54] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:45:54] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2023-03-16 00:45:54] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-16 00:45:54] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:45:55] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2023-03-16 00:45:55] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:45:55] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:45:55] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2023-03-16 00:45:55] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:45:56] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2023-03-16 00:45:56] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:45:56] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:45:56] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:45:56] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:57] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-16 00:45:57] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 0 ms to minimize.
[2023-03-16 00:45:57] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 0 ms to minimize.
[2023-03-16 00:45:57] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:45:57] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:58] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2023-03-16 00:45:58] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:45:58] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:45:58] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:45:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4605 ms
[2023-03-16 00:45:59] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-16 00:45:59] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 0 ms to minimize.
[2023-03-16 00:45:59] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:45:59] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:46:00] [INFO ] Deduced a trap composed of 77 places in 232 ms of which 0 ms to minimize.
[2023-03-16 00:46:00] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:46:00] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:46:00] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 1 ms to minimize.
[2023-03-16 00:46:01] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2023-03-16 00:46:01] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 2 ms to minimize.
[2023-03-16 00:46:01] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:46:01] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:46:01] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:46:02] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:46:02] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-03-16 00:46:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3396 ms
[2023-03-16 00:46:02] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2023-03-16 00:46:02] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-16 00:46:03] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 0 ms to minimize.
[2023-03-16 00:46:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 769 ms
[2023-03-16 00:46:03] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-16 00:46:03] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:46:04] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2023-03-16 00:46:04] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 0 ms to minimize.
[2023-03-16 00:46:04] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:46:04] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-16 00:46:05] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:46:05] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 0 ms to minimize.
[2023-03-16 00:46:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1899 ms
[2023-03-16 00:46:05] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2023-03-16 00:46:05] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 1 ms to minimize.
[2023-03-16 00:46:06] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:46:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
[2023-03-16 00:46:06] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:46:06] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:46:06] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2023-03-16 00:46:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2023-03-16 00:46:07] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-16 00:46:07] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2023-03-16 00:46:07] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:46:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2023-03-16 00:46:08] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:46:08] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:46:08] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 0 ms to minimize.
[2023-03-16 00:46:08] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:46:08] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2023-03-16 00:46:09] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 0 ms to minimize.
[2023-03-16 00:46:09] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 1 ms to minimize.
[2023-03-16 00:46:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1614 ms
[2023-03-16 00:46:09] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-16 00:46:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-16 00:46:10] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:46:10] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:46:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-16 00:46:10] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2023-03-16 00:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-16 00:46:11] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:46:11] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 1 ms to minimize.
[2023-03-16 00:46:11] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 0 ms to minimize.
[2023-03-16 00:46:11] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:46:12] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2023-03-16 00:46:12] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:46:12] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2023-03-16 00:46:12] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2023-03-16 00:46:13] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-16 00:46:13] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:46:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2435 ms
[2023-03-16 00:46:13] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-16 00:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-16 00:46:14] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-16 00:46:15] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-16 00:46:15] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-16 00:46:16] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:46:16] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 0 ms to minimize.
[2023-03-16 00:46:16] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2023-03-16 00:46:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 878 ms
[2023-03-16 00:46:17] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 1 ms to minimize.
[2023-03-16 00:46:17] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-16 00:46:17] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2023-03-16 00:46:17] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:46:17] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1263 ms
[2023-03-16 00:46:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-16 00:46:18] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 0 ms to minimize.
[2023-03-16 00:46:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 442 ms
[2023-03-16 00:46:19] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:46:19] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 0 ms to minimize.
[2023-03-16 00:46:19] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:46:20] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:46:20] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2023-03-16 00:46:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1142 ms
[2023-03-16 00:46:21] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2023-03-16 00:46:21] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:46:22] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:46:22] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:46:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 686 ms
[2023-03-16 00:46:22] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-16 00:46:24] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 0 ms to minimize.
[2023-03-16 00:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-16 00:46:24] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2023-03-16 00:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-16 00:46:25] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-16 00:46:25] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:46:26] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:46:26] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:46:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1202 ms
[2023-03-16 00:46:28] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2023-03-16 00:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-16 00:46:29] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2023-03-16 00:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-16 00:46:29] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 0 ms to minimize.
[2023-03-16 00:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-16 00:46:30] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2023-03-16 00:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-16 00:46:30] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-16 00:46:32] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2023-03-16 00:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-16 00:46:33] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 1 ms to minimize.
[2023-03-16 00:46:33] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 1 ms to minimize.
[2023-03-16 00:46:33] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:46:34] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:46:34] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:46:34] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 0 ms to minimize.
[2023-03-16 00:46:34] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:46:35] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 1 ms to minimize.
[2023-03-16 00:46:35] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 0 ms to minimize.
[2023-03-16 00:46:35] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 0 ms to minimize.
[2023-03-16 00:46:35] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 1 ms to minimize.
[2023-03-16 00:46:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2527 ms
[2023-03-16 00:46:35] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2023-03-16 00:46:36] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 1 ms to minimize.
[2023-03-16 00:46:36] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:46:36] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 0 ms to minimize.
[2023-03-16 00:46:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 847 ms
[2023-03-16 00:46:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-16 00:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-16 00:46:37] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 0 ms to minimize.
[2023-03-16 00:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-16 00:46:38] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-16 00:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-16 00:46:38] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 1 ms to minimize.
[2023-03-16 00:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-16 00:46:39] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:46:39] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2023-03-16 00:46:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2023-03-16 00:46:40] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-16 00:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-16 00:46:41] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-16 00:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-16 00:46:42] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 1 ms to minimize.
[2023-03-16 00:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-16 00:46:43] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 1 ms to minimize.
[2023-03-16 00:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-16 00:46:44] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-16 00:46:45] [INFO ] After 76027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :201
Attempting to minimize the solution found.
Minimization took 17035 ms.
[2023-03-16 00:47:02] [INFO ] After 102656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :201
Parikh walk visited 0 properties in 1433 ms.
Support contains 161 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 27 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 688217 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 201) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 199) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 199) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 197) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 91021 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 196 properties.
[2023-03-16 00:49:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:49:15] [INFO ] Invariant cache hit.
[2023-03-16 00:49:16] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 00:49:21] [INFO ] After 4189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:189
[2023-03-16 00:49:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:49:22] [INFO ] After 203ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:49:22] [INFO ] After 6706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:49:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:49:29] [INFO ] After 4353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :196
[2023-03-16 00:49:34] [INFO ] After 4665ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :196
[2023-03-16 00:49:34] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:49:34] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-16 00:49:34] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-16 00:49:34] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:49:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 855 ms
[2023-03-16 00:49:35] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-16 00:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-16 00:49:35] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2023-03-16 00:49:35] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-16 00:49:35] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2023-03-16 00:49:36] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 0 ms to minimize.
[2023-03-16 00:49:36] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:49:36] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-16 00:49:36] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 0 ms to minimize.
[2023-03-16 00:49:36] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 0 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:49:37] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:49:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3299 ms
[2023-03-16 00:49:38] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2023-03-16 00:49:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 772 ms
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-03-16 00:49:40] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 723 ms
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2023-03-16 00:49:41] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:49:42] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2023-03-16 00:49:43] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2023-03-16 00:49:44] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 0 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2023-03-16 00:49:45] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4643 ms
[2023-03-16 00:49:46] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:49:46] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-16 00:49:46] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
[2023-03-16 00:49:46] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-16 00:49:47] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-16 00:49:47] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:49:47] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-16 00:49:47] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:49:48] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2023-03-16 00:49:48] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2023-03-16 00:49:48] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:49:48] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-16 00:49:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2814 ms
[2023-03-16 00:49:48] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2023-03-16 00:49:49] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-16 00:49:49] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:49:49] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-16 00:49:49] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2023-03-16 00:49:50] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 0 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2023-03-16 00:49:51] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3125 ms
[2023-03-16 00:49:52] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:49:52] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 0 ms to minimize.
[2023-03-16 00:49:52] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 1 ms to minimize.
[2023-03-16 00:49:52] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:49:52] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1207 ms
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-16 00:49:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 836 ms
[2023-03-16 00:49:54] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:49:54] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-16 00:49:54] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-16 00:49:54] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:49:54] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2023-03-16 00:49:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 869 ms
[2023-03-16 00:49:55] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2023-03-16 00:49:55] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-16 00:49:55] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2023-03-16 00:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-16 00:49:55] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-16 00:49:55] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:49:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1458 ms
[2023-03-16 00:49:57] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:49:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-16 00:49:57] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-16 00:49:57] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:49:57] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2023-03-16 00:49:58] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-16 00:49:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2023-03-16 00:49:58] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2023-03-16 00:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-16 00:49:58] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-16 00:49:58] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-03-16 00:49:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-03-16 00:49:59] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2023-03-16 00:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-16 00:49:59] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2023-03-16 00:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-16 00:50:00] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-16 00:50:00] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-16 00:50:01] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2023-03-16 00:50:01] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-16 00:50:01] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2023-03-16 00:50:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2023-03-16 00:50:01] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-16 00:50:02] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-16 00:50:02] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-16 00:50:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2023-03-16 00:50:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 511 ms
[2023-03-16 00:50:02] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-16 00:50:03] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:50:03] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:50:03] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-16 00:50:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-16 00:50:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 601 ms
[2023-03-16 00:50:03] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2023-03-16 00:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-16 00:50:04] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:50:04] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 662 ms
[2023-03-16 00:50:04] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-16 00:50:05] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2023-03-16 00:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-16 00:50:05] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:50:06] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-16 00:50:06] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2023-03-16 00:50:06] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-16 00:50:07] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-16 00:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-16 00:50:07] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-16 00:50:08] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:50:08] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2023-03-16 00:50:08] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1085 ms
[2023-03-16 00:50:09] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2023-03-16 00:50:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-16 00:50:10] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:50:10] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2023-03-16 00:50:10] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:50:11] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 1 ms to minimize.
[2023-03-16 00:50:11] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:50:11] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 1 ms to minimize.
[2023-03-16 00:50:11] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 0 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:50:12] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:50:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2866 ms
[2023-03-16 00:50:14] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2023-03-16 00:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-16 00:50:14] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-16 00:50:16] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2023-03-16 00:50:16] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:50:16] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:50:16] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:50:17] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 4 ms to minimize.
[2023-03-16 00:50:17] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:50:17] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 0 ms to minimize.
[2023-03-16 00:50:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1215 ms
[2023-03-16 00:50:18] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-16 00:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-16 00:50:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-16 00:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-16 00:50:18] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:50:18] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:50:19] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-03-16 00:50:19] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:50:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 705 ms
[2023-03-16 00:50:20] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2023-03-16 00:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-16 00:50:21] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2023-03-16 00:50:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-16 00:50:21] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:50:21] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-03-16 00:50:21] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2023-03-16 00:50:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-16 00:50:21] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2023-03-16 00:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-16 00:50:22] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2023-03-16 00:50:22] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:50:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2023-03-16 00:50:23] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-16 00:50:24] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 1 ms to minimize.
[2023-03-16 00:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-16 00:50:25] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-16 00:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-16 00:50:26] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2023-03-16 00:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-16 00:50:26] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2023-03-16 00:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-16 00:50:27] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 1 ms to minimize.
[2023-03-16 00:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-16 00:50:27] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 1 ms to minimize.
[2023-03-16 00:50:27] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2023-03-16 00:50:28] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 1 ms to minimize.
[2023-03-16 00:50:28] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 1 ms to minimize.
[2023-03-16 00:50:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1115 ms
[2023-03-16 00:50:29] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2023-03-16 00:50:30] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2023-03-16 00:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-16 00:50:32] [INFO ] After 62663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :196
Attempting to minimize the solution found.
Minimization took 13967 ms.
[2023-03-16 00:50:45] [INFO ] After 83923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :196
Parikh walk visited 0 properties in 2521 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 782049 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 196) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 95149 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 196 properties.
[2023-03-16 00:52:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:52:56] [INFO ] Invariant cache hit.
[2023-03-16 00:52:58] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:53:06] [INFO ] After 6549ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:189
[2023-03-16 00:53:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:53:06] [INFO ] After 324ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:53:06] [INFO ] After 10305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:53:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:53:15] [INFO ] After 5677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :196
[2023-03-16 00:53:22] [INFO ] After 6207ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :196
[2023-03-16 00:53:22] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 1 ms to minimize.
[2023-03-16 00:53:22] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 0 ms to minimize.
[2023-03-16 00:53:22] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2023-03-16 00:53:23] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-16 00:53:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1035 ms
[2023-03-16 00:53:23] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-16 00:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-16 00:53:23] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
[2023-03-16 00:53:24] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2023-03-16 00:53:24] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:53:24] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 0 ms to minimize.
[2023-03-16 00:53:24] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 1 ms to minimize.
[2023-03-16 00:53:25] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 0 ms to minimize.
[2023-03-16 00:53:25] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2023-03-16 00:53:25] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-16 00:53:25] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:53:26] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2023-03-16 00:53:26] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 0 ms to minimize.
[2023-03-16 00:53:26] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:53:26] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:53:27] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 0 ms to minimize.
[2023-03-16 00:53:27] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:53:27] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 1 ms to minimize.
[2023-03-16 00:53:27] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-16 00:53:28] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-16 00:53:28] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-16 00:53:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4687 ms
[2023-03-16 00:53:28] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:53:28] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2023-03-16 00:53:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-03-16 00:53:29] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:53:29] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2023-03-16 00:53:29] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2023-03-16 00:53:29] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1154 ms
[2023-03-16 00:53:30] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 0 ms to minimize.
[2023-03-16 00:53:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 777 ms
[2023-03-16 00:53:31] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:53:31] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:53:31] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 0 ms to minimize.
[2023-03-16 00:53:31] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2023-03-16 00:53:31] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-16 00:53:32] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2023-03-16 00:53:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1130 ms
[2023-03-16 00:53:32] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2023-03-16 00:53:32] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-16 00:53:32] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 0 ms to minimize.
[2023-03-16 00:53:33] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 0 ms to minimize.
[2023-03-16 00:53:33] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2023-03-16 00:53:33] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2023-03-16 00:53:33] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2023-03-16 00:53:34] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-16 00:53:34] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2023-03-16 00:53:34] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2023-03-16 00:53:34] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2023-03-16 00:53:35] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 1 ms to minimize.
[2023-03-16 00:53:35] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 0 ms to minimize.
[2023-03-16 00:53:35] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-16 00:53:35] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2023-03-16 00:53:36] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2023-03-16 00:53:36] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
[2023-03-16 00:53:36] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 0 ms to minimize.
[2023-03-16 00:53:36] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 0 ms to minimize.
[2023-03-16 00:53:36] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:53:37] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 1 ms to minimize.
[2023-03-16 00:53:37] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2023-03-16 00:53:37] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:53:37] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2023-03-16 00:53:38] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6617 ms
[2023-03-16 00:53:39] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 1 ms to minimize.
[2023-03-16 00:53:39] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 3 ms to minimize.
[2023-03-16 00:53:39] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-16 00:53:39] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-16 00:53:40] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-16 00:53:40] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 0 ms to minimize.
[2023-03-16 00:53:40] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 0 ms to minimize.
[2023-03-16 00:53:40] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2023-03-16 00:53:41] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 0 ms to minimize.
[2023-03-16 00:53:41] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 0 ms to minimize.
[2023-03-16 00:53:41] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2023-03-16 00:53:41] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-16 00:53:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3178 ms
[2023-03-16 00:53:42] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:53:42] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 1 ms to minimize.
[2023-03-16 00:53:42] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:53:43] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:53:43] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-16 00:53:43] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2023-03-16 00:53:43] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:53:43] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:53:44] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2023-03-16 00:53:44] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:53:44] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:53:44] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-16 00:53:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3623 ms
[2023-03-16 00:53:45] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2023-03-16 00:53:46] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2023-03-16 00:53:46] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 0 ms to minimize.
[2023-03-16 00:53:46] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 0 ms to minimize.
[2023-03-16 00:53:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-16 00:53:46] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-16 00:53:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1321 ms
[2023-03-16 00:53:47] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:53:47] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2023-03-16 00:53:47] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-16 00:53:47] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-16 00:53:47] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-16 00:53:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1027 ms
[2023-03-16 00:53:48] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2023-03-16 00:53:48] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-16 00:53:48] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-16 00:53:49] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:53:49] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:53:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1276 ms
[2023-03-16 00:53:49] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 1 ms to minimize.
[2023-03-16 00:53:49] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:53:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2023-03-16 00:53:50] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2023-03-16 00:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-16 00:53:50] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:53:50] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 0 ms to minimize.
[2023-03-16 00:53:51] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-03-16 00:53:51] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:53:51] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2023-03-16 00:53:51] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:53:51] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2023-03-16 00:53:52] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:53:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1797 ms
[2023-03-16 00:53:52] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2023-03-16 00:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-16 00:53:52] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:53:52] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2023-03-16 00:53:52] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:53:53] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2023-03-16 00:53:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2023-03-16 00:53:53] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-16 00:53:53] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2023-03-16 00:53:54] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-16 00:53:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-03-16 00:53:54] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2023-03-16 00:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-16 00:53:55] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-16 00:53:55] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2023-03-16 00:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-16 00:53:56] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-16 00:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-16 00:53:56] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-16 00:53:56] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-16 00:53:56] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-16 00:53:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2023-03-16 00:53:57] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 0 ms to minimize.
[2023-03-16 00:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-16 00:53:57] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 0 ms to minimize.
[2023-03-16 00:53:57] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2023-03-16 00:53:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-16 00:53:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 581 ms
[2023-03-16 00:53:58] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-03-16 00:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-16 00:53:58] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:53:59] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:53:59] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-16 00:53:59] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-16 00:53:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2023-03-16 00:53:59] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2023-03-16 00:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-16 00:53:59] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:54:00] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:54:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 713 ms
[2023-03-16 00:54:00] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-16 00:54:00] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2023-03-16 00:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-16 00:54:01] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 0 ms to minimize.
[2023-03-16 00:54:01] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2023-03-16 00:54:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2023-03-16 00:54:02] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:54:02] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2023-03-16 00:54:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2023-03-16 00:54:03] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-16 00:54:03] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-16 00:54:04] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-16 00:54:04] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:54:04] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:54:04] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:54:05] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 0 ms to minimize.
[2023-03-16 00:54:05] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:54:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1211 ms
[2023-03-16 00:54:05] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-16 00:54:05] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:54:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 459 ms
[2023-03-16 00:54:06] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-16 00:54:06] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:54:06] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 0 ms to minimize.
[2023-03-16 00:54:07] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:54:07] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:54:07] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 1 ms to minimize.
[2023-03-16 00:54:07] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 0 ms to minimize.
[2023-03-16 00:54:08] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:54:08] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:54:08] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:54:08] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:54:08] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2023-03-16 00:54:09] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3037 ms
[2023-03-16 00:54:10] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2023-03-16 00:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-16 00:54:11] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-16 00:54:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-16 00:54:13] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2023-03-16 00:54:13] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 1 ms to minimize.
[2023-03-16 00:54:13] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:54:13] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 1 ms to minimize.
[2023-03-16 00:54:14] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:54:14] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2023-03-16 00:54:14] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:54:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1455 ms
[2023-03-16 00:54:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-16 00:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-16 00:54:15] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-16 00:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-16 00:54:15] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-16 00:54:16] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2023-03-16 00:54:16] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:54:16] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-16 00:54:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 771 ms
[2023-03-16 00:54:17] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-16 00:54:18] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-16 00:54:18] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:54:18] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:54:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2023-03-16 00:54:18] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2023-03-16 00:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-16 00:54:19] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2023-03-16 00:54:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-16 00:54:19] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:54:19] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 0 ms to minimize.
[2023-03-16 00:54:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-03-16 00:54:20] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-16 00:54:20] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2023-03-16 00:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-16 00:54:21] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-16 00:54:21] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-16 00:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-16 00:54:22] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-16 00:54:22] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-16 00:54:22] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:54:22] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:54:22] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 0 ms to minimize.
[2023-03-16 00:54:23] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:54:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 626 ms
[2023-03-16 00:54:24] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-16 00:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-16 00:54:24] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-16 00:54:25] [INFO ] After 69611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :196
Attempting to minimize the solution found.
Minimization took 11923 ms.
[2023-03-16 00:54:37] [INFO ] After 90674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :196
Parikh walk visited 0 properties in 2261 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 00:54:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:54:39] [INFO ] Invariant cache hit.
[2023-03-16 00:54:39] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-16 00:54:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:54:39] [INFO ] Invariant cache hit.
[2023-03-16 00:54:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:54:40] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-16 00:54:40] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 00:54:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:54:40] [INFO ] Invariant cache hit.
[2023-03-16 00:54:41] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4038 ms. (steps per millisecond=24 ) properties (out of 158) seen :70
Running SMT prover for 88 properties.
[2023-03-16 00:54:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:54:45] [INFO ] Invariant cache hit.
[2023-03-16 00:54:45] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 00:54:45] [INFO ] After 282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :88
[2023-03-16 00:54:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:54:45] [INFO ] After 288ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :88
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-16 00:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-03-16 00:54:47] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2023-03-16 00:54:47] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2023-03-16 00:54:47] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2023-03-16 00:54:47] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 0 ms to minimize.
[2023-03-16 00:54:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 516 ms
[2023-03-16 00:54:47] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2023-03-16 00:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-16 00:54:48] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:54:48] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:54:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-16 00:54:48] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:54:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-16 00:54:48] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:54:48] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 0 ms to minimize.
[2023-03-16 00:54:49] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2023-03-16 00:54:49] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:54:49] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:54:49] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 0 ms to minimize.
[2023-03-16 00:54:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 928 ms
[2023-03-16 00:54:49] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 0 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2023-03-16 00:54:50] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-16 00:54:50] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:54:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2023-03-16 00:54:51] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2023-03-16 00:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-16 00:54:51] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2023-03-16 00:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-16 00:54:51] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-16 00:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-16 00:54:51] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2023-03-16 00:54:51] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2023-03-16 00:54:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-16 00:54:52] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2023-03-16 00:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-16 00:54:52] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:54:52] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2023-03-16 00:54:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-16 00:54:52] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2023-03-16 00:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-16 00:54:52] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2023-03-16 00:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2023-03-16 00:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2023-03-16 00:54:53] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1061 ms
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:54:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2023-03-16 00:54:55] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-16 00:54:55] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2023-03-16 00:54:55] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2023-03-16 00:54:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-16 00:54:56] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 0 ms to minimize.
[2023-03-16 00:54:56] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2023-03-16 00:54:56] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:54:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 511 ms
[2023-03-16 00:54:57] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2023-03-16 00:54:57] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 1 ms to minimize.
[2023-03-16 00:54:57] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 0 ms to minimize.
[2023-03-16 00:54:57] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:54:57] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:54:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 989 ms
[2023-03-16 00:54:58] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 0 ms to minimize.
[2023-03-16 00:54:58] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:54:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-03-16 00:54:58] [INFO ] After 12899ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:88
[2023-03-16 00:54:58] [INFO ] After 13340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:88
[2023-03-16 00:54:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 00:54:59] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :88
[2023-03-16 00:54:59] [INFO ] After 566ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :88
[2023-03-16 00:54:59] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:54:59] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2023-03-16 00:55:00] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:55:00] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2023-03-16 00:55:00] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2023-03-16 00:55:00] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2023-03-16 00:55:01] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-16 00:55:01] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 1 ms to minimize.
[2023-03-16 00:55:01] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2023-03-16 00:55:02] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2023-03-16 00:55:02] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2023-03-16 00:55:02] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 0 ms to minimize.
[2023-03-16 00:55:02] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-16 00:55:03] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 0 ms to minimize.
[2023-03-16 00:55:03] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 0 ms to minimize.
[2023-03-16 00:55:03] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:55:03] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 0 ms to minimize.
[2023-03-16 00:55:04] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:55:04] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:55:04] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-16 00:55:04] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:55:05] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:55:05] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2023-03-16 00:55:05] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2023-03-16 00:55:05] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2023-03-16 00:55:06] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:55:06] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2023-03-16 00:55:06] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6587 ms
[2023-03-16 00:55:06] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:55:06] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 0 ms to minimize.
[2023-03-16 00:55:06] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2023-03-16 00:55:07] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2023-03-16 00:55:07] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:55:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1090 ms
[2023-03-16 00:55:07] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2023-03-16 00:55:07] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
[2023-03-16 00:55:08] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:55:08] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2023-03-16 00:55:08] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 0 ms to minimize.
[2023-03-16 00:55:08] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 0 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:55:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2590 ms
[2023-03-16 00:55:10] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2023-03-16 00:55:10] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:55:10] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-16 00:55:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1920 ms
[2023-03-16 00:55:12] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:55:12] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2023-03-16 00:55:12] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:55:12] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:55:13] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 0 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2248 ms
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2023-03-16 00:55:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 502 ms
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:55:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 726 ms
[2023-03-16 00:55:16] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:55:16] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-16 00:55:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-03-16 00:55:16] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:55:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-16 00:55:16] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-16 00:55:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 0 ms to minimize.
[2023-03-16 00:55:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 970 ms
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:55:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:18] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2023-03-16 00:55:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1293 ms
[2023-03-16 00:55:20] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-16 00:55:20] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-16 00:55:20] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 2 ms to minimize.
[2023-03-16 00:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1053 ms
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:55:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1078 ms
[2023-03-16 00:55:23] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 0 ms to minimize.
[2023-03-16 00:55:23] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2023-03-16 00:55:23] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2023-03-16 00:55:23] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-16 00:55:23] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:55:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 884 ms
[2023-03-16 00:55:24] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-16 00:55:24] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2023-03-16 00:55:24] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:55:24] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2023-03-16 00:55:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 959 ms
[2023-03-16 00:55:25] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-16 00:55:25] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:55:25] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2023-03-16 00:55:25] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 0 ms to minimize.
[2023-03-16 00:55:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 573 ms
[2023-03-16 00:55:26] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2023-03-16 00:55:26] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2023-03-16 00:55:26] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2023-03-16 00:55:26] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 682 ms
[2023-03-16 00:55:27] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:55:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 826 ms
[2023-03-16 00:55:28] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2023-03-16 00:55:28] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2023-03-16 00:55:28] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:55:28] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:55:28] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1199 ms
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:55:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-16 00:55:29] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 0 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2023-03-16 00:55:30] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2023-03-16 00:55:31] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-16 00:55:31] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-16 00:55:31] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2023-03-16 00:55:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1142 ms
[2023-03-16 00:55:31] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2023-03-16 00:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-16 00:55:32] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-16 00:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-16 00:55:32] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-16 00:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-16 00:55:33] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-16 00:55:33] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-16 00:55:33] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 0 ms to minimize.
[2023-03-16 00:55:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 812 ms
[2023-03-16 00:55:33] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:55:34] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-16 00:55:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-16 00:55:34] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2023-03-16 00:55:34] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 1 ms to minimize.
[2023-03-16 00:55:35] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 0 ms to minimize.
[2023-03-16 00:55:35] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2023-03-16 00:55:35] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 0 ms to minimize.
[2023-03-16 00:55:35] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2023-03-16 00:55:36] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 1 ms to minimize.
[2023-03-16 00:55:36] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2023-03-16 00:55:36] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2023-03-16 00:55:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2158 ms
[2023-03-16 00:55:36] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 0 ms to minimize.
[2023-03-16 00:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-16 00:55:37] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2023-03-16 00:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-16 00:55:37] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:55:38] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2023-03-16 00:55:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2023-03-16 00:55:38] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:55:38] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:55:38] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:55:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 537 ms
[2023-03-16 00:55:39] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2023-03-16 00:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-16 00:55:39] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2023-03-16 00:55:39] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 0 ms to minimize.
[2023-03-16 00:55:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-16 00:55:40] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 0 ms to minimize.
[2023-03-16 00:55:40] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:55:40] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-16 00:55:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 666 ms
[2023-03-16 00:55:41] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2023-03-16 00:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-16 00:55:41] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2023-03-16 00:55:41] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2023-03-16 00:55:41] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 0 ms to minimize.
[2023-03-16 00:55:42] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-16 00:55:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1043 ms
[2023-03-16 00:55:42] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2023-03-16 00:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-16 00:55:43] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 0 ms to minimize.
[2023-03-16 00:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-16 00:55:43] [INFO ] After 44272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :88
Attempting to minimize the solution found.
Minimization took 3736 ms.
[2023-03-16 00:55:47] [INFO ] After 48555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :88
Interrupted random walk after 605863 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 196) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 94322 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 196 properties.
[2023-03-16 00:57:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:57:54] [INFO ] Invariant cache hit.
[2023-03-16 00:57:56] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 00:58:05] [INFO ] After 6728ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:189
[2023-03-16 00:58:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:58:05] [INFO ] After 333ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:58:05] [INFO ] After 10498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:196
[2023-03-16 00:58:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 00:58:14] [INFO ] After 5836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :196
[2023-03-16 00:58:19] [INFO ] After 5168ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :196
[2023-03-16 00:58:20] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2023-03-16 00:58:20] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-16 00:58:20] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2023-03-16 00:58:20] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-16 00:58:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1060 ms
[2023-03-16 00:58:21] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:58:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-16 00:58:21] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 0 ms to minimize.
[2023-03-16 00:58:21] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-16 00:58:22] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:58:22] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:58:22] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:58:22] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:58:23] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 0 ms to minimize.
[2023-03-16 00:58:23] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2023-03-16 00:58:23] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:58:23] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:58:24] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:58:24] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:58:24] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 1 ms to minimize.
[2023-03-16 00:58:24] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:58:25] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 0 ms to minimize.
[2023-03-16 00:58:25] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 1 ms to minimize.
[2023-03-16 00:58:25] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:58:25] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:58:26] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:58:26] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4691 ms
[2023-03-16 00:58:26] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:58:26] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 0 ms to minimize.
[2023-03-16 00:58:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-16 00:58:27] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2023-03-16 00:58:27] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:58:27] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-16 00:58:27] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2023-03-16 00:58:27] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2023-03-16 00:58:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1164 ms
[2023-03-16 00:58:28] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:58:28] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:58:28] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:58:28] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2023-03-16 00:58:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 719 ms
[2023-03-16 00:58:28] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:58:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1135 ms
[2023-03-16 00:58:30] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 0 ms to minimize.
[2023-03-16 00:58:30] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2023-03-16 00:58:30] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 0 ms to minimize.
[2023-03-16 00:58:30] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:58:31] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 1 ms to minimize.
[2023-03-16 00:58:31] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:58:31] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-16 00:58:31] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2023-03-16 00:58:32] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-16 00:58:32] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 0 ms to minimize.
[2023-03-16 00:58:32] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-16 00:58:32] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2023-03-16 00:58:33] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:58:33] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2023-03-16 00:58:33] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2023-03-16 00:58:33] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:58:34] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 0 ms to minimize.
[2023-03-16 00:58:34] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:58:34] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 1 ms to minimize.
[2023-03-16 00:58:34] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:58:34] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:58:35] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-16 00:58:35] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:58:35] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-16 00:58:35] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 0 ms to minimize.
[2023-03-16 00:58:35] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2023-03-16 00:58:36] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-16 00:58:36] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-03-16 00:58:36] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-16 00:58:36] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6508 ms
[2023-03-16 00:58:36] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:58:36] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:58:37] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-16 00:58:37] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-16 00:58:37] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-16 00:58:38] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 0 ms to minimize.
[2023-03-16 00:58:38] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2023-03-16 00:58:38] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2023-03-16 00:58:38] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 0 ms to minimize.
[2023-03-16 00:58:39] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 0 ms to minimize.
[2023-03-16 00:58:39] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:58:39] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-16 00:58:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3202 ms
[2023-03-16 00:58:39] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2023-03-16 00:58:40] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2023-03-16 00:58:40] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:58:40] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:58:41] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 1 ms to minimize.
[2023-03-16 00:58:41] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:58:41] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:58:41] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 1 ms to minimize.
[2023-03-16 00:58:41] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
[2023-03-16 00:58:42] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:58:43] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-03-16 00:58:43] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2023-03-16 00:58:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3568 ms
[2023-03-16 00:58:43] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:58:43] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 1 ms to minimize.
[2023-03-16 00:58:44] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:58:44] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2023-03-16 00:58:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-03-16 00:58:44] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-16 00:58:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1286 ms
[2023-03-16 00:58:44] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 1 ms to minimize.
[2023-03-16 00:58:45] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2023-03-16 00:58:45] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:58:45] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:58:45] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:58:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1023 ms
[2023-03-16 00:58:45] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2023-03-16 00:58:46] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-16 00:58:46] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 0 ms to minimize.
[2023-03-16 00:58:46] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:58:46] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2023-03-16 00:58:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1171 ms
[2023-03-16 00:58:47] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2023-03-16 00:58:47] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2023-03-16 00:58:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-16 00:58:47] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-03-16 00:58:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-16 00:58:47] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-16 00:58:48] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-16 00:58:48] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2023-03-16 00:58:48] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:58:48] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:58:49] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2023-03-16 00:58:49] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:58:49] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2023-03-16 00:58:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1777 ms
[2023-03-16 00:58:49] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:58:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-16 00:58:50] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:58:50] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:58:50] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:58:50] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:58:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 640 ms
[2023-03-16 00:58:51] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2023-03-16 00:58:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-16 00:58:51] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2023-03-16 00:58:51] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2023-03-16 00:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-03-16 00:58:52] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2023-03-16 00:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-16 00:58:52] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 0 ms to minimize.
[2023-03-16 00:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-16 00:58:53] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2023-03-16 00:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-16 00:58:53] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2023-03-16 00:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-16 00:58:54] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-16 00:58:54] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-16 00:58:54] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-03-16 00:58:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
[2023-03-16 00:58:54] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2023-03-16 00:58:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-16 00:58:55] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2023-03-16 00:58:55] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2023-03-16 00:58:55] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-16 00:58:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 623 ms
[2023-03-16 00:58:55] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 0 ms to minimize.
[2023-03-16 00:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-16 00:58:56] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2023-03-16 00:58:56] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:58:56] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-16 00:58:56] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-16 00:58:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 678 ms
[2023-03-16 00:58:57] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-16 00:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-16 00:58:57] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:58:57] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 1 ms to minimize.
[2023-03-16 00:58:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-16 00:58:58] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-16 00:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-16 00:58:58] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-16 00:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-16 00:58:59] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:58:59] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:58:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-03-16 00:58:59] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:58:59] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:58:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-03-16 00:59:00] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-16 00:59:01] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2023-03-16 00:59:01] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 1 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-16 00:59:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1164 ms
[2023-03-16 00:59:03] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-16 00:59:03] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 0 ms to minimize.
[2023-03-16 00:59:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2023-03-16 00:59:04] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 0 ms to minimize.
[2023-03-16 00:59:04] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2023-03-16 00:59:04] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 0 ms to minimize.
[2023-03-16 00:59:04] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 1 ms to minimize.
[2023-03-16 00:59:05] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2023-03-16 00:59:05] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-16 00:59:05] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 0 ms to minimize.
[2023-03-16 00:59:05] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 0 ms to minimize.
[2023-03-16 00:59:06] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2023-03-16 00:59:06] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2023-03-16 00:59:06] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-16 00:59:06] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-16 00:59:06] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:59:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3115 ms
[2023-03-16 00:59:07] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-16 00:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-16 00:59:08] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-16 00:59:10] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:59:10] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 1 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 0 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2023-03-16 00:59:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1439 ms
[2023-03-16 00:59:12] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-16 00:59:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-16 00:59:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-16 00:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-16 00:59:13] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:59:13] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 0 ms to minimize.
[2023-03-16 00:59:13] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2023-03-16 00:59:13] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-03-16 00:59:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 813 ms
[2023-03-16 00:59:15] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2023-03-16 00:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-16 00:59:15] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 0 ms to minimize.
[2023-03-16 00:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-16 00:59:16] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2023-03-16 00:59:16] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-16 00:59:16] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-16 00:59:17] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2023-03-16 00:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-16 00:59:17] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
[2023-03-16 00:59:18] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 0 ms to minimize.
[2023-03-16 00:59:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 516 ms
[2023-03-16 00:59:19] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 0 ms to minimize.
[2023-03-16 00:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-16 00:59:19] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-16 00:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-16 00:59:20] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 1 ms to minimize.
[2023-03-16 00:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-16 00:59:21] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2023-03-16 00:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-16 00:59:21] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-16 00:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-16 00:59:22] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 1 ms to minimize.
[2023-03-16 00:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-16 00:59:22] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 1 ms to minimize.
[2023-03-16 00:59:23] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2023-03-16 00:59:23] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 1 ms to minimize.
[2023-03-16 00:59:23] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 0 ms to minimize.
[2023-03-16 00:59:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1021 ms
[2023-03-16 00:59:24] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2023-03-16 00:59:25] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2023-03-16 00:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-16 00:59:27] [INFO ] After 72362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :196
Attempting to minimize the solution found.
Minimization took 17519 ms.
[2023-03-16 00:59:44] [INFO ] After 99254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :196
Parikh walk visited 0 properties in 2573 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 21 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 00:59:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:59:47] [INFO ] Invariant cache hit.
[2023-03-16 00:59:47] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-16 00:59:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:59:47] [INFO ] Invariant cache hit.
[2023-03-16 00:59:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:59:48] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-16 00:59:48] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-16 00:59:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:59:48] [INFO ] Invariant cache hit.
[2023-03-16 00:59:48] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1736 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3686 ms. (steps per millisecond=27 ) properties (out of 158) seen :68
Running SMT prover for 90 properties.
[2023-03-16 00:59:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 00:59:52] [INFO ] Invariant cache hit.
[2023-03-16 00:59:52] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 00:59:53] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :90
[2023-03-16 00:59:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 00:59:53] [INFO ] After 341ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :90
[2023-03-16 00:59:53] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-16 00:59:53] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-16 00:59:54] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:59:54] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 1 ms to minimize.
[2023-03-16 00:59:54] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 1 ms to minimize.
[2023-03-16 00:59:54] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2023-03-16 00:59:55] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:59:55] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 1 ms to minimize.
[2023-03-16 00:59:55] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2023-03-16 00:59:55] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 0 ms to minimize.
[2023-03-16 00:59:56] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 1 ms to minimize.
[2023-03-16 00:59:56] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 1 ms to minimize.
[2023-03-16 00:59:56] [INFO ] Deduced a trap composed of 63 places in 222 ms of which 1 ms to minimize.
[2023-03-16 00:59:56] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 1 ms to minimize.
[2023-03-16 00:59:57] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 0 ms to minimize.
[2023-03-16 00:59:57] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 1 ms to minimize.
[2023-03-16 00:59:57] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 1 ms to minimize.
[2023-03-16 00:59:57] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 1 ms to minimize.
[2023-03-16 00:59:58] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 1 ms to minimize.
[2023-03-16 00:59:58] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 1 ms to minimize.
[2023-03-16 00:59:58] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 1 ms to minimize.
[2023-03-16 00:59:58] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 1 ms to minimize.
[2023-03-16 00:59:59] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2023-03-16 00:59:59] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2023-03-16 00:59:59] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 1 ms to minimize.
[2023-03-16 00:59:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6214 ms
[2023-03-16 00:59:59] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-16 01:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-16 01:00:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-16 01:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-16 01:00:00] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2023-03-16 01:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-16 01:00:01] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 0 ms to minimize.
[2023-03-16 01:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-16 01:00:01] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 0 ms to minimize.
[2023-03-16 01:00:02] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2023-03-16 01:00:02] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-16 01:00:02] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-03-16 01:00:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2023-03-16 01:00:02] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2023-03-16 01:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-16 01:00:03] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 1 ms to minimize.
[2023-03-16 01:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-16 01:00:03] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2023-03-16 01:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-16 01:00:05] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 0 ms to minimize.
[2023-03-16 01:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-16 01:00:05] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:00:05] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 1 ms to minimize.
[2023-03-16 01:00:06] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:00:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 783 ms
[2023-03-16 01:00:06] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 0 ms to minimize.
[2023-03-16 01:00:06] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2023-03-16 01:00:06] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 1 ms to minimize.
[2023-03-16 01:00:07] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2023-03-16 01:00:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 806 ms
[2023-03-16 01:00:07] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2023-03-16 01:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-16 01:00:07] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2023-03-16 01:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-16 01:00:07] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-03-16 01:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-16 01:00:08] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2023-03-16 01:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-16 01:00:08] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-16 01:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-16 01:00:09] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 1 ms to minimize.
[2023-03-16 01:00:09] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 0 ms to minimize.
[2023-03-16 01:00:09] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 0 ms to minimize.
[2023-03-16 01:00:10] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 1 ms to minimize.
[2023-03-16 01:00:10] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 0 ms to minimize.
[2023-03-16 01:00:10] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:00:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1224 ms
[2023-03-16 01:00:10] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 1 ms to minimize.
[2023-03-16 01:00:11] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 0 ms to minimize.
[2023-03-16 01:00:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2023-03-16 01:00:11] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2023-03-16 01:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-16 01:00:11] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2023-03-16 01:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-16 01:00:12] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 1 ms to minimize.
[2023-03-16 01:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-16 01:00:12] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 0 ms to minimize.
[2023-03-16 01:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-16 01:00:12] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 1 ms to minimize.
[2023-03-16 01:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-16 01:00:13] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2023-03-16 01:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-16 01:00:13] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 0 ms to minimize.
[2023-03-16 01:00:13] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 1 ms to minimize.
[2023-03-16 01:00:14] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 1 ms to minimize.
[2023-03-16 01:00:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 885 ms
[2023-03-16 01:00:14] [INFO ] After 21207ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:90
[2023-03-16 01:00:14] [INFO ] After 21689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:90
[2023-03-16 01:00:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:00:14] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :90
[2023-03-16 01:00:15] [INFO ] After 433ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :90
[2023-03-16 01:00:15] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2023-03-16 01:00:15] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-16 01:00:16] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-16 01:00:16] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2023-03-16 01:00:16] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2023-03-16 01:00:17] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-16 01:00:17] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 0 ms to minimize.
[2023-03-16 01:00:17] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-16 01:00:17] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-16 01:00:17] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2023-03-16 01:00:18] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-16 01:00:18] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-16 01:00:18] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 1 ms to minimize.
[2023-03-16 01:00:18] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 0 ms to minimize.
[2023-03-16 01:00:19] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2023-03-16 01:00:19] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2023-03-16 01:00:19] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 1 ms to minimize.
[2023-03-16 01:00:19] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 1 ms to minimize.
[2023-03-16 01:00:20] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 1 ms to minimize.
[2023-03-16 01:00:20] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 1 ms to minimize.
[2023-03-16 01:00:20] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-16 01:00:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5401 ms
[2023-03-16 01:00:21] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:00:21] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 1 ms to minimize.
[2023-03-16 01:00:21] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:00:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 759 ms
[2023-03-16 01:00:21] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:00:22] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:00:22] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:00:22] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-03-16 01:00:22] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2023-03-16 01:00:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1116 ms
[2023-03-16 01:00:22] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2023-03-16 01:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-16 01:00:23] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 0 ms to minimize.
[2023-03-16 01:00:23] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2023-03-16 01:00:23] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-16 01:00:23] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2023-03-16 01:00:23] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2023-03-16 01:00:24] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 0 ms to minimize.
[2023-03-16 01:00:24] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 0 ms to minimize.
[2023-03-16 01:00:24] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-16 01:00:24] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-16 01:00:24] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 1 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2193 ms
[2023-03-16 01:00:25] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 1 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2023-03-16 01:00:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 492 ms
[2023-03-16 01:00:26] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 1 ms to minimize.
[2023-03-16 01:00:26] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 0 ms to minimize.
[2023-03-16 01:00:26] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2023-03-16 01:00:26] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-16 01:00:27] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-16 01:00:27] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2023-03-16 01:00:27] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-16 01:00:27] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-16 01:00:27] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2023-03-16 01:00:28] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-16 01:00:28] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-16 01:00:28] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2023-03-16 01:00:28] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3641 ms
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-16 01:00:29] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 0 ms to minimize.
[2023-03-16 01:00:30] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2023-03-16 01:00:30] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:00:30] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2023-03-16 01:00:30] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-16 01:00:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 971 ms
[2023-03-16 01:00:30] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2023-03-16 01:00:31] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2023-03-16 01:00:31] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2023-03-16 01:00:31] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2023-03-16 01:00:31] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-16 01:00:32] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2023-03-16 01:00:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3323 ms
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2023-03-16 01:00:34] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2023-03-16 01:00:35] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2023-03-16 01:00:36] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2958 ms
[2023-03-16 01:00:37] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2023-03-16 01:00:37] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2023-03-16 01:00:37] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2023-03-16 01:00:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2023-03-16 01:00:37] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-16 01:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-16 01:00:37] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-16 01:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-16 01:00:38] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-16 01:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-16 01:00:38] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2023-03-16 01:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-16 01:00:38] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 913 ms
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-16 01:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-16 01:00:39] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:00:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1163 ms
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 698 ms
[2023-03-16 01:00:41] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2023-03-16 01:00:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 0 ms to minimize.
[2023-03-16 01:00:42] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2023-03-16 01:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 474 ms
[2023-03-16 01:00:43] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2023-03-16 01:00:44] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2023-03-16 01:00:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-16 01:00:44] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 0 ms to minimize.
[2023-03-16 01:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-16 01:00:44] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2023-03-16 01:00:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 981 ms
[2023-03-16 01:00:45] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2023-03-16 01:00:46] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 921 ms
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2023-03-16 01:00:47] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-16 01:00:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 0 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2023-03-16 01:00:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-16 01:00:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2023-03-16 01:00:49] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-16 01:00:50] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-03-16 01:00:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2023-03-16 01:00:50] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-16 01:00:50] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-16 01:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-16 01:00:51] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-16 01:00:51] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2023-03-16 01:00:51] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 547 ms
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 4 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2023-03-16 01:00:52] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 956 ms
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 508 ms
[2023-03-16 01:00:53] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 0 ms to minimize.
[2023-03-16 01:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-16 01:00:54] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2023-03-16 01:00:54] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-03-16 01:00:54] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-16 01:00:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 497 ms
[2023-03-16 01:00:54] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2023-03-16 01:00:55] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2023-03-16 01:00:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2023-03-16 01:00:55] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2023-03-16 01:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-16 01:00:55] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2023-03-16 01:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-16 01:00:55] [INFO ] After 40498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :90
Attempting to minimize the solution found.
Minimization took 3532 ms.
[2023-03-16 01:00:59] [INFO ] After 44698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :90
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Finished random walk after 5501 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=343 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Finished random walk after 362 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=181 )
Finished random walk after 770 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=256 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17777 steps, run visited all 1 properties in 60 ms. (steps per millisecond=296 )
Probabilistic random walk after 17777 steps, saw 4286 distinct states, run finished after 60 ms. (steps per millisecond=296 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54647 steps, run visited all 1 properties in 165 ms. (steps per millisecond=331 )
Probabilistic random walk after 54647 steps, saw 9438 distinct states, run finished after 166 ms. (steps per millisecond=329 ) properties seen :1
Finished random walk after 2007 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=334 )
Finished random walk after 5176 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=398 )
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1041922 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1041922 steps, saw 152254 distinct states, run finished after 3003 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:02] [INFO ] Invariant cache hit.
[2023-03-16 01:01:02] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:02] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:02] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:02] [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 21 ms.
[2023-03-16 01:01:02] [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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 21 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043448 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043448 steps, saw 152413 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:05] [INFO ] Invariant cache hit.
[2023-03-16 01:01:06] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:06] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:06] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:06] [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 21 ms.
[2023-03-16 01:01:06] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:06] [INFO ] Invariant cache hit.
[2023-03-16 01:01:06] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 01:01:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:06] [INFO ] Invariant cache hit.
[2023-03-16 01:01:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:07] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-16 01:01:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:01:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:07] [INFO ] Invariant cache hit.
[2023-03-16 01:01:08] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1856 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 4 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 23 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:01:08] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:01:08] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:08] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:01:08] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043147 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043147 steps, saw 152393 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:11] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:01:11] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:11] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:11] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:11] [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 20 ms.
[2023-03-16 01:01:11] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 18 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1044652 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1044652 steps, saw 152648 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:14] [INFO ] Invariant cache hit.
[2023-03-16 01:01:14] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:01:15] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:15] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:15] [INFO ] After 75ms 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-16 01:01:15] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:15] [INFO ] Invariant cache hit.
[2023-03-16 01:01:15] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-16 01:01:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:15] [INFO ] Invariant cache hit.
[2023-03-16 01:01:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:16] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2023-03-16 01:01:16] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-16 01:01:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:16] [INFO ] Invariant cache hit.
[2023-03-16 01:01:17] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2053 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 18 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:01:17] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:01:17] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:17] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:01:17] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 3605 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=300 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043252 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043252 steps, saw 152405 distinct states, run finished after 3004 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:20] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:01:20] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:01:20] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:20] [INFO ] After 48ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:20] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 01:01:20] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1028657 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1028657 steps, saw 149769 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:23] [INFO ] Invariant cache hit.
[2023-03-16 01:01:24] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:24] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:24] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:24] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 01:01:24] [INFO ] After 371ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:24] [INFO ] Invariant cache hit.
[2023-03-16 01:01:24] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-16 01:01:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:24] [INFO ] Invariant cache hit.
[2023-03-16 01:01:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:25] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-16 01:01:25] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:01:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:26] [INFO ] Invariant cache hit.
[2023-03-16 01:01:26] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2087 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 20 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:01:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:01:26] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:26] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:01:26] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 878738 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 878738 steps, saw 128491 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:29] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-16 01:01:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:01:29] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:30] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:30] [INFO ] After 88ms 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-16 01:01:30] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1038779 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1038779 steps, saw 151837 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:33] [INFO ] Invariant cache hit.
[2023-03-16 01:01:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:01:33] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:33] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:33] [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 19 ms.
[2023-03-16 01:01:33] [INFO ] After 358ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:33] [INFO ] Invariant cache hit.
[2023-03-16 01:01:33] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-16 01:01:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:33] [INFO ] Invariant cache hit.
[2023-03-16 01:01:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:34] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2023-03-16 01:01:34] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:01:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:34] [INFO ] Invariant cache hit.
[2023-03-16 01:01:35] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1990 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:01:35] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:01:35] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:35] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:01:35] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 4677 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=779 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1036721 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1036721 steps, saw 151294 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:38] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:01:38] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:01:39] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:39] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:39] [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 19 ms.
[2023-03-16 01:01:39] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 981589 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 981589 steps, saw 143144 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:42] [INFO ] Invariant cache hit.
[2023-03-16 01:01:42] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:01:42] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:42] [INFO ] After 69ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:42] [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 31 ms.
[2023-03-16 01:01:42] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:42] [INFO ] Invariant cache hit.
[2023-03-16 01:01:43] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-16 01:01:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:43] [INFO ] Invariant cache hit.
[2023-03-16 01:01:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:44] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2023-03-16 01:01:44] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:01:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:44] [INFO ] Invariant cache hit.
[2023-03-16 01:01:45] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2301 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:01:45] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:01:45] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:01:45] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 911050 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 911050 steps, saw 133307 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:48] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 01:01:48] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:48] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:48] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:48] [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 19 ms.
[2023-03-16 01:01:48] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 977767 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 977767 steps, saw 142814 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:51] [INFO ] Invariant cache hit.
[2023-03-16 01:01:51] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:01:52] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:52] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:52] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 01:01:52] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:01:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:52] [INFO ] Invariant cache hit.
[2023-03-16 01:01:52] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-16 01:01:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:52] [INFO ] Invariant cache hit.
[2023-03-16 01:01:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:53] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2023-03-16 01:01:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:01:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:01:53] [INFO ] Invariant cache hit.
[2023-03-16 01:01:54] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2295 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 14 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:01:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:01:54] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:01:54] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:54] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:01:54] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1309 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=261 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2609 steps, run visited all 1 properties in 15 ms. (steps per millisecond=173 )
Probabilistic random walk after 2609 steps, saw 1587 distinct states, run finished after 16 ms. (steps per millisecond=163 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970242 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970242 steps, saw 141945 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:01:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:01:57] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:01:57] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:01:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:01:58] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:01:58] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:01:58] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 01:01:58] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 981456 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 981456 steps, saw 143143 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:01] [INFO ] Invariant cache hit.
[2023-03-16 01:02:01] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:02:01] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:01] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:01] [INFO ] After 75ms 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-16 01:02:01] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:01] [INFO ] Invariant cache hit.
[2023-03-16 01:02:02] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-16 01:02:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:02] [INFO ] Invariant cache hit.
[2023-03-16 01:02:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:03] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2023-03-16 01:02:03] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:02:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:03] [INFO ] Invariant cache hit.
[2023-03-16 01:02:04] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2410 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 19 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:04] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:02:04] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:02:04] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:04] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:02:04] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 918603 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 918603 steps, saw 133620 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:07] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 01:02:07] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:07] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:07] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:07] [INFO ] After 75ms 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-16 01:02:07] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982107 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982107 steps, saw 143213 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:10] [INFO ] Invariant cache hit.
[2023-03-16 01:02:10] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:11] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:11] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:11] [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 20 ms.
[2023-03-16 01:02:11] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:11] [INFO ] Invariant cache hit.
[2023-03-16 01:02:11] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-16 01:02:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:11] [INFO ] Invariant cache hit.
[2023-03-16 01:02:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:13] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2023-03-16 01:02:13] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:02:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:13] [INFO ] Invariant cache hit.
[2023-03-16 01:02:13] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2696 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:02:13] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:02:13] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:13] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:02:13] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 6943 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=408 )
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 971082 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 971082 steps, saw 142082 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:17] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:02:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 01:02:17] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:17] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:17] [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 30 ms.
[2023-03-16 01:02:17] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 965181 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 965181 steps, saw 141167 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:20] [INFO ] Invariant cache hit.
[2023-03-16 01:02:20] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:21] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:21] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:21] [INFO ] After 88ms 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-16 01:02:21] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:21] [INFO ] Invariant cache hit.
[2023-03-16 01:02:21] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-16 01:02:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:21] [INFO ] Invariant cache hit.
[2023-03-16 01:02:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:22] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2023-03-16 01:02:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:02:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:22] [INFO ] Invariant cache hit.
[2023-03-16 01:02:23] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2520 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:02:23] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:02:23] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:23] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:02:23] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 7520 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=940 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 941010 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 941010 steps, saw 137794 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:26] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:02:26] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:27] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:27] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:27] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 01:02:27] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982758 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982758 steps, saw 143258 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:30] [INFO ] Invariant cache hit.
[2023-03-16 01:02:30] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:02:30] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:30] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:30] [INFO ] After 81ms 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-16 01:02:30] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:30] [INFO ] Invariant cache hit.
[2023-03-16 01:02:31] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-16 01:02:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:31] [INFO ] Invariant cache hit.
[2023-03-16 01:02:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:32] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-16 01:02:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:02:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:32] [INFO ] Invariant cache hit.
[2023-03-16 01:02:33] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2672 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:02:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:02:33] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:33] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:02:33] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 980861 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 980861 steps, saw 143096 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:36] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:02:36] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:36] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:36] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:36] [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 34 ms.
[2023-03-16 01:02:37] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 953015 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 953015 steps, saw 138850 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:40] [INFO ] Invariant cache hit.
[2023-03-16 01:02:40] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:02:40] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:40] [INFO ] After 57ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:40] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 01:02:40] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:40] [INFO ] Invariant cache hit.
[2023-03-16 01:02:41] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-16 01:02:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:41] [INFO ] Invariant cache hit.
[2023-03-16 01:02:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:42] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
[2023-03-16 01:02:42] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:02:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:42] [INFO ] Invariant cache hit.
[2023-03-16 01:02:43] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2722 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:02:43] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:02:43] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:43] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:02:43] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131806 steps, run visited all 1 properties in 415 ms. (steps per millisecond=317 )
Probabilistic random walk after 131806 steps, saw 21265 distinct states, run finished after 415 ms. (steps per millisecond=317 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442412 steps, run visited all 1 properties in 1421 ms. (steps per millisecond=311 )
Probabilistic random walk after 442412 steps, saw 65835 distinct states, run finished after 1421 ms. (steps per millisecond=311 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 658 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=658 )
Finished random walk after 7363 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=460 )
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 502 steps, run visited all 1 properties in 5 ms. (steps per millisecond=100 )
Probabilistic random walk after 502 steps, saw 380 distinct states, run finished after 5 ms. (steps per millisecond=100 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131807 steps, run visited all 1 properties in 387 ms. (steps per millisecond=340 )
Probabilistic random walk after 131807 steps, saw 21266 distinct states, run finished after 387 ms. (steps per millisecond=340 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17778 steps, run visited all 1 properties in 58 ms. (steps per millisecond=306 )
Probabilistic random walk after 17778 steps, saw 4287 distinct states, run finished after 58 ms. (steps per millisecond=306 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1046388 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1046388 steps, saw 152887 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:48] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:02:48] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:02:49] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:49] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:49] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:02:49] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 940002 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940002 steps, saw 137600 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:52] [INFO ] Invariant cache hit.
[2023-03-16 01:02:52] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:02:52] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:52] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:52] [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 30 ms.
[2023-03-16 01:02:52] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:02:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:52] [INFO ] Invariant cache hit.
[2023-03-16 01:02:53] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-16 01:02:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:53] [INFO ] Invariant cache hit.
[2023-03-16 01:02:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:54] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2023-03-16 01:02:54] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:02:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:02:54] [INFO ] Invariant cache hit.
[2023-03-16 01:02:55] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2706 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:02:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:02:55] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:02:55] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:55] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:02:55] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982541 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982541 steps, saw 143236 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:02:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:02:58] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:02:58] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:02:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:02:59] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:02:59] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:02:59] [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 18 ms.
[2023-03-16 01:02:59] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1092763 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1092763 steps, saw 158993 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:02] [INFO ] Invariant cache hit.
[2023-03-16 01:03:02] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:02] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:02] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:02] [INFO ] After 69ms 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-16 01:03:02] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:02] [INFO ] Invariant cache hit.
[2023-03-16 01:03:03] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-16 01:03:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:03] [INFO ] Invariant cache hit.
[2023-03-16 01:03:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:04] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-03-16 01:03:04] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:03:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:04] [INFO ] Invariant cache hit.
[2023-03-16 01:03:05] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2727 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 7 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:03:05] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:05] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:05] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:03:05] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048649 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048649 steps, saw 153266 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:08] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:03:08] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:08] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:08] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:08] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 01:03:08] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1025759 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025759 steps, saw 149492 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:11] [INFO ] Invariant cache hit.
[2023-03-16 01:03:12] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:12] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:12] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:12] [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 25 ms.
[2023-03-16 01:03:12] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:12] [INFO ] Invariant cache hit.
[2023-03-16 01:03:12] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-16 01:03:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:12] [INFO ] Invariant cache hit.
[2023-03-16 01:03:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:13] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2023-03-16 01:03:13] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:03:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:13] [INFO ] Invariant cache hit.
[2023-03-16 01:03:14] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:03:14] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:14] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:14] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:03:14] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819728 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 819728 steps, saw 120580 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:17] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:03:17] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:17] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:17] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:17] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-16 01:03:17] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1019396 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1019396 steps, saw 148868 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:20] [INFO ] Invariant cache hit.
[2023-03-16 01:03:20] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:21] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:21] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:21] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:03:21] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:21] [INFO ] Invariant cache hit.
[2023-03-16 01:03:21] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-16 01:03:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:21] [INFO ] Invariant cache hit.
[2023-03-16 01:03:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:23] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-03-16 01:03:23] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:03:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:23] [INFO ] Invariant cache hit.
[2023-03-16 01:03:24] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2753 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 24 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:03:24] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:24] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:03:24] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 954485 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 954485 steps, saw 138851 distinct states, run finished after 3004 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:27] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:03:27] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:03:27] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:27] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:27] [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 18 ms.
[2023-03-16 01:03:27] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1013705 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1013705 steps, saw 148199 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:30] [INFO ] Invariant cache hit.
[2023-03-16 01:03:30] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:03:31] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:31] [INFO ] After 68ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:31] [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 31 ms.
[2023-03-16 01:03:31] [INFO ] After 550ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:31] [INFO ] Invariant cache hit.
[2023-03-16 01:03:31] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-16 01:03:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:31] [INFO ] Invariant cache hit.
[2023-03-16 01:03:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:32] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2023-03-16 01:03:33] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:03:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:33] [INFO ] Invariant cache hit.
[2023-03-16 01:03:33] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2395 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:03:33] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:33] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:33] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:03:33] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1033655 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1033655 steps, saw 149789 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:36] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:03:36] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:03:37] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:37] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:37] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-16 01:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-16 01:03:37] [INFO ] After 298ms 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-16 01:03:37] [INFO ] After 573ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 993517 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 993517 steps, saw 144010 distinct states, run finished after 3003 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:40] [INFO ] Invariant cache hit.
[2023-03-16 01:03:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:40] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:40] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:41] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-16 01:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-16 01:03:41] [INFO ] After 338ms 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-16 01:03:41] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:41] [INFO ] Invariant cache hit.
[2023-03-16 01:03:41] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-16 01:03:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:41] [INFO ] Invariant cache hit.
[2023-03-16 01:03:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:43] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2023-03-16 01:03:43] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:03:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:43] [INFO ] Invariant cache hit.
[2023-03-16 01:03:44] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2816 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:03:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:44] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:44] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:03:44] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 983206 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 983206 steps, saw 143302 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:47] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:03:47] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:47] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:47] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:47] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 01:03:47] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1009974 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009974 steps, saw 147637 distinct states, run finished after 3005 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:50] [INFO ] Invariant cache hit.
[2023-03-16 01:03:50] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:03:50] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:51] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:51] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 01:03:51] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:03:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:51] [INFO ] Invariant cache hit.
[2023-03-16 01:03:51] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-16 01:03:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:51] [INFO ] Invariant cache hit.
[2023-03-16 01:03:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:52] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
[2023-03-16 01:03:52] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:03:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:03:52] [INFO ] Invariant cache hit.
[2023-03-16 01:03:53] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2492 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:03:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:03:53] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:03:53] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:53] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:03:53] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1045884 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1045884 steps, saw 152781 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:03:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:03:56] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:03:56] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:03:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:03:57] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:03:57] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:03:57] [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 18 ms.
[2023-03-16 01:03:57] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1003191 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003191 steps, saw 146782 distinct states, run finished after 3002 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:00] [INFO ] Invariant cache hit.
[2023-03-16 01:04:00] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:04:00] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:00] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:00] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:04:00] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:00] [INFO ] Invariant cache hit.
[2023-03-16 01:04:01] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-16 01:04:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:01] [INFO ] Invariant cache hit.
[2023-03-16 01:04:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:02] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2023-03-16 01:04:02] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:04:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:02] [INFO ] Invariant cache hit.
[2023-03-16 01:04:03] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2579 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:03] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:04:03] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:04:03] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:03] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:04:03] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1008679 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1008679 steps, saw 147474 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:06] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:04:06] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-16 01:04:06] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:06] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:06] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 01:04:06] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 958517 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958517 steps, saw 139577 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:09] [INFO ] Invariant cache hit.
[2023-03-16 01:04:09] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:04:10] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:10] [INFO ] After 50ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:10] [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 31 ms.
[2023-03-16 01:04:10] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:10] [INFO ] Invariant cache hit.
[2023-03-16 01:04:10] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-16 01:04:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:10] [INFO ] Invariant cache hit.
[2023-03-16 01:04:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:12] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2023-03-16 01:04:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:04:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:12] [INFO ] Invariant cache hit.
[2023-03-16 01:04:12] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2526 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:04:12] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:04:12] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:12] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:04:12] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 903231 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 903231 steps, saw 132076 distinct states, run finished after 3002 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:15] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 01:04:16] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:04:16] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:16] [INFO ] After 69ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:16] [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 31 ms.
[2023-03-16 01:04:16] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 988883 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 988883 steps, saw 143862 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:19] [INFO ] Invariant cache hit.
[2023-03-16 01:04:19] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:04:20] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:20] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:20] [INFO ] After 75ms 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-16 01:04:20] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:20] [INFO ] Invariant cache hit.
[2023-03-16 01:04:20] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-16 01:04:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:20] [INFO ] Invariant cache hit.
[2023-03-16 01:04:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:22] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-16 01:04:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:04:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:22] [INFO ] Invariant cache hit.
[2023-03-16 01:04:22] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2734 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:04:22] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:04:22] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:22] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:04:22] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1088304 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1088304 steps, saw 158611 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:25] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:04:26] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:04:26] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:26] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:26] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2023-03-16 01:04:26] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-16 01:04:27] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 0 ms to minimize.
[2023-03-16 01:04:27] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-16 01:04:27] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2023-03-16 01:04:27] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-16 01:04:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1467 ms
[2023-03-16 01:04:27] [INFO ] After 1559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:04:27] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 956256 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 956256 steps, saw 138852 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:30] [INFO ] Invariant cache hit.
[2023-03-16 01:04:30] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:04:31] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:31] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:31] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-16 01:04:31] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:04:32] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-16 01:04:32] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:04:32] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 1 ms to minimize.
[2023-03-16 01:04:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1255 ms
[2023-03-16 01:04:32] [INFO ] After 1329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:04:32] [INFO ] After 1611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:32] [INFO ] Invariant cache hit.
[2023-03-16 01:04:33] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-16 01:04:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:33] [INFO ] Invariant cache hit.
[2023-03-16 01:04:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:34] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-03-16 01:04:34] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:04:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:34] [INFO ] Invariant cache hit.
[2023-03-16 01:04:35] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2862 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 22 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:04:35] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:04:35] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:35] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:04:35] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 980742 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 980742 steps, saw 143085 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:38] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:04:38] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:04:38] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:39] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:39] [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 30 ms.
[2023-03-16 01:04:39] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 967498 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967498 steps, saw 141518 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:42] [INFO ] Invariant cache hit.
[2023-03-16 01:04:42] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:04:42] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:42] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:42] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:04:42] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:42] [INFO ] Invariant cache hit.
[2023-03-16 01:04:43] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-16 01:04:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:43] [INFO ] Invariant cache hit.
[2023-03-16 01:04:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:44] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2023-03-16 01:04:44] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:04:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:44] [INFO ] Invariant cache hit.
[2023-03-16 01:04:45] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2395 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:04:45] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:04:45] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:45] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:04:45] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 959084 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 959084 steps, saw 139902 distinct states, run finished after 3006 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:48] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:04:48] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:04:48] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:48] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:49] [INFO ] After 127ms 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-16 01:04:49] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 907697 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 907697 steps, saw 132791 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:52] [INFO ] Invariant cache hit.
[2023-03-16 01:04:52] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:04:52] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:52] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:52] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 01:04:52] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:04:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:52] [INFO ] Invariant cache hit.
[2023-03-16 01:04:52] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-16 01:04:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:52] [INFO ] Invariant cache hit.
[2023-03-16 01:04:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:54] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2023-03-16 01:04:54] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:04:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:04:54] [INFO ] Invariant cache hit.
[2023-03-16 01:04:55] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2636 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:04:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:04:55] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:04:55] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:55] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:04:55] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 986349 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 986349 steps, saw 143670 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:04:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:04:58] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-16 01:04:58] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:04:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:04:58] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:04:58] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:04:58] [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 19 ms.
[2023-03-16 01:04:58] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944650 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944650 steps, saw 138316 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:01] [INFO ] Invariant cache hit.
[2023-03-16 01:05:01] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:05:02] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:02] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:02] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:05:02] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:02] [INFO ] Invariant cache hit.
[2023-03-16 01:05:02] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-16 01:05:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:02] [INFO ] Invariant cache hit.
[2023-03-16 01:05:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:04] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-16 01:05:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:05:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:04] [INFO ] Invariant cache hit.
[2023-03-16 01:05:05] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2687 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:05:05] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:05:05] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:05] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:05:05] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1002246 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1002246 steps, saw 146441 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:08] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:05:08] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:05:08] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:08] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:08] [INFO ] After 117ms 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-16 01:05:08] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 874454 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 874454 steps, saw 128211 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:11] [INFO ] Invariant cache hit.
[2023-03-16 01:05:12] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-16 01:05:12] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:12] [INFO ] After 71ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:12] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:05:12] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:12] [INFO ] Invariant cache hit.
[2023-03-16 01:05:13] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-16 01:05:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:13] [INFO ] Invariant cache hit.
[2023-03-16 01:05:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:14] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2023-03-16 01:05:14] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:05:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:14] [INFO ] Invariant cache hit.
[2023-03-16 01:05:15] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2736 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 17 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:05:15] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:05:15] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:15] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 01:05:15] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 777616 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 777616 steps, saw 113749 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:18] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:05:18] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:05:18] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:18] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:18] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2023-03-16 01:05:19] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-16 01:05:19] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 0 ms to minimize.
[2023-03-16 01:05:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 564 ms
[2023-03-16 01:05:19] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:05:19] [INFO ] After 921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970235 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970235 steps, saw 141945 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:22] [INFO ] Invariant cache hit.
[2023-03-16 01:05:22] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:05:22] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:22] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:23] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2023-03-16 01:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-16 01:05:23] [INFO ] After 234ms 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-16 01:05:23] [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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:23] [INFO ] Invariant cache hit.
[2023-03-16 01:05:23] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-16 01:05:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:23] [INFO ] Invariant cache hit.
[2023-03-16 01:05:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:24] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2023-03-16 01:05:24] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:05:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:24] [INFO ] Invariant cache hit.
[2023-03-16 01:05:25] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:05:25] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:05:25] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:05:25] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1000489 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000489 steps, saw 145631 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:28] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:05:28] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:05:28] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:28] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:28] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 01:05:28] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1047277 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1047277 steps, saw 153035 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:31] [INFO ] Invariant cache hit.
[2023-03-16 01:05:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:05:32] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:32] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:32] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:05:32] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:32] [INFO ] Invariant cache hit.
[2023-03-16 01:05:32] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-16 01:05:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:32] [INFO ] Invariant cache hit.
[2023-03-16 01:05:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:33] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
[2023-03-16 01:05:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:05:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:33] [INFO ] Invariant cache hit.
[2023-03-16 01:05:34] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2025 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:05:34] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:05:34] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:34] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:05:34] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 901320 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901320 steps, saw 131817 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:37] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:05:37] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:05:37] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:37] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:37] [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 29 ms.
[2023-03-16 01:05:37] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 890974 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 890974 steps, saw 130745 distinct states, run finished after 3004 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:40] [INFO ] Invariant cache hit.
[2023-03-16 01:05:40] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:05:41] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:41] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:41] [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 18 ms.
[2023-03-16 01:05:41] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:41] [INFO ] Invariant cache hit.
[2023-03-16 01:05:41] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-16 01:05:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:41] [INFO ] Invariant cache hit.
[2023-03-16 01:05:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:42] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2023-03-16 01:05:42] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:05:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:42] [INFO ] Invariant cache hit.
[2023-03-16 01:05:43] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:43] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-16 01:05:43] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:05:43] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:43] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:05:43] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066926 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066926 steps, saw 154748 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:46] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:05:46] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:05:46] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:46] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:46] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-16 01:05:47] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 984739 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984739 steps, saw 143472 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:50] [INFO ] Invariant cache hit.
[2023-03-16 01:05:50] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:05:50] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:50] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:50] [INFO ] After 69ms 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-16 01:05:50] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:50] [INFO ] Invariant cache hit.
[2023-03-16 01:05:50] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-16 01:05:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:50] [INFO ] Invariant cache hit.
[2023-03-16 01:05:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:52] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2023-03-16 01:05:52] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 01:05:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:52] [INFO ] Invariant cache hit.
[2023-03-16 01:05:52] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2319 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:05:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:05:52] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:05:52] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:52] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:05:52] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 963928 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 963928 steps, saw 141031 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:05:55] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:05:55] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:05:56] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:56] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:56] [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 30 ms.
[2023-03-16 01:05:56] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 965552 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 965552 steps, saw 141213 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:05:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:59] [INFO ] Invariant cache hit.
[2023-03-16 01:05:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:05:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:05:59] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:05:59] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:05:59] [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 21 ms.
[2023-03-16 01:05:59] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:05:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:05:59] [INFO ] Invariant cache hit.
[2023-03-16 01:06:00] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-16 01:06:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:00] [INFO ] Invariant cache hit.
[2023-03-16 01:06:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:01] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2023-03-16 01:06:01] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:06:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:01] [INFO ] Invariant cache hit.
[2023-03-16 01:06:02] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2136 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 17 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:02] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:06:02] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:06:02] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:02] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:06:02] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982093 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982093 steps, saw 143209 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:05] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:06:05] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:06:05] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:05] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:05] [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 21 ms.
[2023-03-16 01:06:05] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1038275 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1038275 steps, saw 151799 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:08] [INFO ] Invariant cache hit.
[2023-03-16 01:06:08] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:09] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:09] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:09] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-16 01:06:09] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-16 01:06:09] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2023-03-16 01:06:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 801 ms
[2023-03-16 01:06:09] [INFO ] After 892ms 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-16 01:06:09] [INFO ] After 1272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:09] [INFO ] Invariant cache hit.
[2023-03-16 01:06:10] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-16 01:06:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:10] [INFO ] Invariant cache hit.
[2023-03-16 01:06:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:11] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-03-16 01:06:11] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:06:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:11] [INFO ] Invariant cache hit.
[2023-03-16 01:06:12] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2833 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:06:12] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:06:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:06:12] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 903406 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 903406 steps, saw 132121 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:15] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:06:15] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:06:16] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:16] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:16] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2023-03-16 01:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-16 01:06:16] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 01:06:16] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1025878 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025878 steps, saw 149492 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:19] [INFO ] Invariant cache hit.
[2023-03-16 01:06:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:06:20] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:20] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:20] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-03-16 01:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-16 01:06:20] [INFO ] After 240ms 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-16 01:06:20] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:20] [INFO ] Invariant cache hit.
[2023-03-16 01:06:20] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-16 01:06:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:20] [INFO ] Invariant cache hit.
[2023-03-16 01:06:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:22] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2023-03-16 01:06:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:06:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:22] [INFO ] Invariant cache hit.
[2023-03-16 01:06:23] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2820 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:06:23] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:06:23] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:23] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:06:23] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 908215 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 908215 steps, saw 132855 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:26] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:06:26] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:06:26] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:26] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:26] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-16 01:06:26] [INFO ] After 497ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944580 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944580 steps, saw 138315 distinct states, run finished after 3003 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:29] [INFO ] Invariant cache hit.
[2023-03-16 01:06:30] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:06:30] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:30] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:30] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:06:30] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:30] [INFO ] Invariant cache hit.
[2023-03-16 01:06:31] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-16 01:06:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:31] [INFO ] Invariant cache hit.
[2023-03-16 01:06:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:32] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2023-03-16 01:06:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:06:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:32] [INFO ] Invariant cache hit.
[2023-03-16 01:06:33] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2704 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:06:33] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:06:33] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:33] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:06:33] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1051897 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1051897 steps, saw 153630 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:36] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:06:36] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:36] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:36] [INFO ] After 54ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:36] [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 29 ms.
[2023-03-16 01:06:36] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 994035 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 994035 steps, saw 144077 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:40] [INFO ] Invariant cache hit.
[2023-03-16 01:06:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:06:40] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:40] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:40] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-16 01:06:40] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:40] [INFO ] Invariant cache hit.
[2023-03-16 01:06:40] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-16 01:06:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:40] [INFO ] Invariant cache hit.
[2023-03-16 01:06:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:41] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-16 01:06:41] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:06:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:41] [INFO ] Invariant cache hit.
[2023-03-16 01:06:42] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1656 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:06:42] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:06:42] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:06:42] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1082746 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{}
Probabilistic random walk after 1082746 steps, saw 157742 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:45] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:06:45] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:45] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:45] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:45] [INFO ] After 80ms 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-16 01:06:45] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1080576 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{}
Probabilistic random walk after 1080576 steps, saw 157437 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:48] [INFO ] Invariant cache hit.
[2023-03-16 01:06:48] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:48] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:49] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:49] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 01:06:49] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:49] [INFO ] Invariant cache hit.
[2023-03-16 01:06:49] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-16 01:06:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:49] [INFO ] Invariant cache hit.
[2023-03-16 01:06:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:50] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-03-16 01:06:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:06:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:50] [INFO ] Invariant cache hit.
[2023-03-16 01:06:50] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1688 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:06:50] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:06:50] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:06:50] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:06:50] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 923027 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923027 steps, saw 134284 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:06:53] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:06:53] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:54] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:54] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:54] [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 19 ms.
[2023-03-16 01:06:54] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1051414 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1051414 steps, saw 153626 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:06:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:57] [INFO ] Invariant cache hit.
[2023-03-16 01:06:57] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:06:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:06:57] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:57] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:06:57] [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 20 ms.
[2023-03-16 01:06:57] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:06:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:57] [INFO ] Invariant cache hit.
[2023-03-16 01:06:58] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 01:06:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:58] [INFO ] Invariant cache hit.
[2023-03-16 01:06:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:06:59] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2023-03-16 01:06:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 01:06:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:06:59] [INFO ] Invariant cache hit.
[2023-03-16 01:06:59] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2226 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 14 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:00] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:07:00] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:00] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:07:00] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 991998 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991998 steps, saw 143864 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:03] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:07:03] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:07:03] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:03] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-16 01:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-16 01:07:03] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 01:07:03] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048866 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048866 steps, saw 153316 distinct states, run finished after 3004 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:06] [INFO ] Invariant cache hit.
[2023-03-16 01:07:06] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:07:06] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:07] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:07] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2023-03-16 01:07:07] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-16 01:07:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-16 01:07:07] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2023-03-16 01:07:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2023-03-16 01:07:07] [INFO ] After 476ms 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-16 01:07:07] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:07] [INFO ] Invariant cache hit.
[2023-03-16 01:07:07] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-16 01:07:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:07] [INFO ] Invariant cache hit.
[2023-03-16 01:07:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:08] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2023-03-16 01:07:08] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:07:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:08] [INFO ] Invariant cache hit.
[2023-03-16 01:07:09] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 6 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:09] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:07:09] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:09] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:07:09] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1016197 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016197 steps, saw 148596 distinct states, run finished after 3003 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:12] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:07:12] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:12] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:12] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:12] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2023-03-16 01:07:13] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-16 01:07:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-16 01:07:13] [INFO ] After 329ms 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-16 01:07:13] [INFO ] After 618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 978908 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 978908 steps, saw 142898 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:16] [INFO ] Invariant cache hit.
[2023-03-16 01:07:16] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:16] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:16] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:16] [INFO ] After 81ms 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-16 01:07:16] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:16] [INFO ] Invariant cache hit.
[2023-03-16 01:07:17] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-16 01:07:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:17] [INFO ] Invariant cache hit.
[2023-03-16 01:07:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:18] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-16 01:07:18] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:07:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:18] [INFO ] Invariant cache hit.
[2023-03-16 01:07:19] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2649 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:19] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:07:19] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:19] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:07:19] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1080282 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1080282 steps, saw 157405 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:22] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:07:22] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:22] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:22] [INFO ] After 48ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:22] [INFO ] After 86ms 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-16 01:07:22] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 995610 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 995610 steps, saw 144296 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:25] [INFO ] Invariant cache hit.
[2023-03-16 01:07:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:07:26] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:26] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:26] [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 20 ms.
[2023-03-16 01:07:26] [INFO ] After 343ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:26] [INFO ] Invariant cache hit.
[2023-03-16 01:07:26] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-16 01:07:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:26] [INFO ] Invariant cache hit.
[2023-03-16 01:07:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:27] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2023-03-16 01:07:27] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 01:07:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:27] [INFO ] Invariant cache hit.
[2023-03-16 01:07:28] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:28] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:07:28] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:28] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:07:28] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1076691 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076691 steps, saw 156948 distinct states, run finished after 3004 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:31] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:07:31] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:31] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:31] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:31] [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 25 ms.
[2023-03-16 01:07:31] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1003548 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003548 steps, saw 146837 distinct states, run finished after 3004 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:34] [INFO ] Invariant cache hit.
[2023-03-16 01:07:34] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:35] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:35] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:35] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 01:07:35] [INFO ] After 349ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:35] [INFO ] Invariant cache hit.
[2023-03-16 01:07:35] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-16 01:07:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:35] [INFO ] Invariant cache hit.
[2023-03-16 01:07:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:37] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2023-03-16 01:07:37] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:07:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:37] [INFO ] Invariant cache hit.
[2023-03-16 01:07:38] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2815 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:38] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-16 01:07:38] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:07:38] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:38] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:07:38] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987812 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 987812 steps, saw 143800 distinct states, run finished after 3003 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:41] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:07:41] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:07:41] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:41] [INFO ] After 71ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:41] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:07:41] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 946764 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946764 steps, saw 138476 distinct states, run finished after 3003 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:44] [INFO ] Invariant cache hit.
[2023-03-16 01:07:44] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:45] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:45] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:45] [INFO ] After 80ms 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-16 01:07:45] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:45] [INFO ] Invariant cache hit.
[2023-03-16 01:07:45] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-16 01:07:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:45] [INFO ] Invariant cache hit.
[2023-03-16 01:07:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:47] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-16 01:07:47] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 01:07:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:47] [INFO ] Invariant cache hit.
[2023-03-16 01:07:47] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2693 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:48] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:07:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:48] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:07:48] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 916153 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916153 steps, saw 133618 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:07:51] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-16 01:07:51] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:07:51] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:51] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:51] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-16 01:07:51] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1014076 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1014076 steps, saw 148264 distinct states, run finished after 3003 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:07:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:54] [INFO ] Invariant cache hit.
[2023-03-16 01:07:54] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:07:55] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:55] [INFO ] After 65ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:55] [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 28 ms.
[2023-03-16 01:07:55] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:07:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:55] [INFO ] Invariant cache hit.
[2023-03-16 01:07:55] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-16 01:07:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:55] [INFO ] Invariant cache hit.
[2023-03-16 01:07:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:07:56] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-16 01:07:56] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:07:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:07:56] [INFO ] Invariant cache hit.
[2023-03-16 01:07:57] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2418 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:07:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:07:57] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:07:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:07:57] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:07:57] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:07:57] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 992859 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992859 steps, saw 143922 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:00] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:08:00] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:08:01] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:01] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:01] [INFO ] After 125ms 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-16 01:08:01] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 896112 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 896112 steps, saw 131299 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:04] [INFO ] Invariant cache hit.
[2023-03-16 01:08:04] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:08:04] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:04] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:04] [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 33 ms.
[2023-03-16 01:08:04] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:04] [INFO ] Invariant cache hit.
[2023-03-16 01:08:05] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-16 01:08:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:05] [INFO ] Invariant cache hit.
[2023-03-16 01:08:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:06] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2023-03-16 01:08:06] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 01:08:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:06] [INFO ] Invariant cache hit.
[2023-03-16 01:08:07] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2921 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:07] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:07] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:08:07] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:07] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:08:07] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969346 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969346 steps, saw 141811 distinct states, run finished after 3005 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:10] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:08:10] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:08:11] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:11] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:11] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-16 01:08:11] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 0 ms to minimize.
[2023-03-16 01:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2023-03-16 01:08:11] [INFO ] After 442ms 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-16 01:08:11] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1002631 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1002631 steps, saw 146618 distinct states, run finished after 3004 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:14] [INFO ] Invariant cache hit.
[2023-03-16 01:08:14] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:08:15] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:15] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:15] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2023-03-16 01:08:15] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:08:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2023-03-16 01:08:15] [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 33 ms.
[2023-03-16 01:08:15] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:15] [INFO ] Invariant cache hit.
[2023-03-16 01:08:16] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-16 01:08:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:16] [INFO ] Invariant cache hit.
[2023-03-16 01:08:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:17] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2023-03-16 01:08:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:08:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:17] [INFO ] Invariant cache hit.
[2023-03-16 01:08:17] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2295 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 14 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:08:17] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:17] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:08:17] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970088 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970088 steps, saw 141926 distinct states, run finished after 3004 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:20] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:08:21] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:08:21] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:21] [INFO ] After 81ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:21] [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 34 ms.
[2023-03-16 01:08:21] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 992124 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992124 steps, saw 143864 distinct states, run finished after 3004 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:24] [INFO ] Invariant cache hit.
[2023-03-16 01:08:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:08:24] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:25] [INFO ] After 76ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:25] [INFO ] After 127ms 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-16 01:08:25] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:25] [INFO ] Invariant cache hit.
[2023-03-16 01:08:25] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-16 01:08:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:25] [INFO ] Invariant cache hit.
[2023-03-16 01:08:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:27] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2023-03-16 01:08:27] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:08:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:27] [INFO ] Invariant cache hit.
[2023-03-16 01:08:27] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2708 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:27] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:08:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:27] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:08:27] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 997360 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997360 steps, saw 144490 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:30] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:08:31] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:08:31] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:31] [INFO ] After 81ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:31] [INFO ] After 134ms 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-16 01:08:31] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 973217 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973217 steps, saw 142397 distinct states, run finished after 3004 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:34] [INFO ] Invariant cache hit.
[2023-03-16 01:08:34] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:08:34] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:34] [INFO ] After 79ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:35] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:08:35] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:35] [INFO ] Invariant cache hit.
[2023-03-16 01:08:35] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-16 01:08:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:35] [INFO ] Invariant cache hit.
[2023-03-16 01:08:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:37] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2023-03-16 01:08:37] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:08:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:37] [INFO ] Invariant cache hit.
[2023-03-16 01:08:37] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2696 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:37] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:08:37] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:37] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:08:37] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 885808 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 885808 steps, saw 129032 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:40] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:08:40] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:08:41] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:41] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:41] [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 30 ms.
[2023-03-16 01:08:41] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 885115 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 885115 steps, saw 128628 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:44] [INFO ] Invariant cache hit.
[2023-03-16 01:08:44] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:08:44] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:44] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:44] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2023-03-16 01:08:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-16 01:08:45] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-16 01:08:45] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2023-03-16 01:08:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 432 ms
[2023-03-16 01:08:45] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:08:45] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:45] [INFO ] Invariant cache hit.
[2023-03-16 01:08:45] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-16 01:08:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:45] [INFO ] Invariant cache hit.
[2023-03-16 01:08:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:46] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2023-03-16 01:08:46] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:08:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:46] [INFO ] Invariant cache hit.
[2023-03-16 01:08:47] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2444 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 17 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:47] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:08:47] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:47] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:08:47] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1005858 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1005858 steps, saw 147062 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:50] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:08:50] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:08:51] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:51] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:51] [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 19 ms.
[2023-03-16 01:08:51] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1047445 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1047445 steps, saw 153067 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:54] [INFO ] Invariant cache hit.
[2023-03-16 01:08:54] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:08:54] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:54] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:54] [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 19 ms.
[2023-03-16 01:08:54] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:08:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:54] [INFO ] Invariant cache hit.
[2023-03-16 01:08:55] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-16 01:08:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:55] [INFO ] Invariant cache hit.
[2023-03-16 01:08:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:08:56] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-16 01:08:56] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:08:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:08:56] [INFO ] Invariant cache hit.
[2023-03-16 01:08:56] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2030 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:08:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:08:56] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:08:56] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:08:56] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:08:56] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 999852 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 999852 steps, saw 145212 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:08:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:08:59] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:08:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:08:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:09:00] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:00] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:00] [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 19 ms.
[2023-03-16 01:09:00] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048642 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048642 steps, saw 153261 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:03] [INFO ] Invariant cache hit.
[2023-03-16 01:09:03] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:03] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:03] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:03] [INFO ] After 75ms 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-16 01:09:03] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:03] [INFO ] Invariant cache hit.
[2023-03-16 01:09:04] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-16 01:09:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:04] [INFO ] Invariant cache hit.
[2023-03-16 01:09:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:05] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2023-03-16 01:09:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:05] [INFO ] Invariant cache hit.
[2023-03-16 01:09:05] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1882 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:05] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:09:05] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:05] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:09:05] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 992782 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992782 steps, saw 143908 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:08] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:09:08] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:09] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:09] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:09] [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 20 ms.
[2023-03-16 01:09:09] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1049041 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049041 steps, saw 153321 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:12] [INFO ] Invariant cache hit.
[2023-03-16 01:09:12] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:09:12] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:12] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09: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 19 ms.
[2023-03-16 01:09:12] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:12] [INFO ] Invariant cache hit.
[2023-03-16 01:09:12] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-16 01:09:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:12] [INFO ] Invariant cache hit.
[2023-03-16 01:09:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:13] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-03-16 01:09:13] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:13] [INFO ] Invariant cache hit.
[2023-03-16 01:09:14] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1831 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 14 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 29 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:14] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:09:14] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:14] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:09:14] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1050637 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1050637 steps, saw 153555 distinct states, run finished after 3006 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:17] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:09:17] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:17] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:17] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:18] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-16 01:09:18] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-16 01:09:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-16 01:09:18] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-16 01:09:18] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 990402 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 990402 steps, saw 143862 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:21] [INFO ] Invariant cache hit.
[2023-03-16 01:09:21] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:21] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:21] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:21] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-16 01:09:21] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:21] [INFO ] Invariant cache hit.
[2023-03-16 01:09:22] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-16 01:09:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:22] [INFO ] Invariant cache hit.
[2023-03-16 01:09:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:22] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-16 01:09:23] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:23] [INFO ] Invariant cache hit.
[2023-03-16 01:09:23] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 8 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:23] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:09:23] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:23] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:09:23] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1005788 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1005788 steps, saw 147057 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:26] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:09:26] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:09:26] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:26] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:27] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-16 01:09:27] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2023-03-16 01:09:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2023-03-16 01:09:27] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:09:27] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 994735 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 994735 steps, saw 144167 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:30] [INFO ] Invariant cache hit.
[2023-03-16 01:09:30] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:30] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:30] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:30] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-16 01:09:31] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2023-03-16 01:09:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-03-16 01:09:31] [INFO ] After 370ms 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-16 01:09:31] [INFO ] After 667ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:31] [INFO ] Invariant cache hit.
[2023-03-16 01:09:31] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-16 01:09:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:31] [INFO ] Invariant cache hit.
[2023-03-16 01:09:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:32] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-16 01:09:32] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:32] [INFO ] Invariant cache hit.
[2023-03-16 01:09:33] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1840 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 8 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:33] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:09:33] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:33] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:09:33] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989590 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989590 steps, saw 143862 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:36] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 01:09:36] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-16 01:09:36] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:36] [INFO ] After 64ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:36] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 01:09:36] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 927542 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 927542 steps, saw 136073 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:39] [INFO ] Invariant cache hit.
[2023-03-16 01:09:39] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:09:40] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:40] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:40] [INFO ] After 81ms 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-16 01:09:40] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:40] [INFO ] Invariant cache hit.
[2023-03-16 01:09:40] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-16 01:09:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:40] [INFO ] Invariant cache hit.
[2023-03-16 01:09:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:41] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2023-03-16 01:09:41] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:41] [INFO ] Invariant cache hit.
[2023-03-16 01:09:42] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2210 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:42] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:09:42] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:09:42] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 952497 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952497 steps, saw 138849 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:45] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:09:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:45] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:46] [INFO ] After 47ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:46] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-16 01:09:46] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 998522 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 998522 steps, saw 144684 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:49] [INFO ] Invariant cache hit.
[2023-03-16 01:09:49] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:09:49] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:49] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:49] [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 24 ms.
[2023-03-16 01:09:49] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:49] [INFO ] Invariant cache hit.
[2023-03-16 01:09:50] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-16 01:09:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:50] [INFO ] Invariant cache hit.
[2023-03-16 01:09:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:51] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2023-03-16 01:09:51] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:09:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:51] [INFO ] Invariant cache hit.
[2023-03-16 01:09:51] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2269 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:09:51] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:09:51] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:09:51] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:51] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:09:51] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969556 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969556 steps, saw 141844 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:09:54] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:09:55] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:55] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:55] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:55] [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 34 ms.
[2023-03-16 01:09:55] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 985460 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985460 steps, saw 143542 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:09:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:58] [INFO ] Invariant cache hit.
[2023-03-16 01:09:58] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:09:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:09:58] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:09:58] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:09:58] [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 28 ms.
[2023-03-16 01:09:58] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:09:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:58] [INFO ] Invariant cache hit.
[2023-03-16 01:09:59] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-16 01:09:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:09:59] [INFO ] Invariant cache hit.
[2023-03-16 01:09:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:00] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2023-03-16 01:10:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:10:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:00] [INFO ] Invariant cache hit.
[2023-03-16 01:10:00] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1956 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 14 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:10:00] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:10:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:00] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:10:00] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1031261 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1031261 steps, saw 149786 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:03] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:10:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:10:04] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:04] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:04] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-16 01:10:04] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2023-03-16 01:10:05] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-16 01:10:05] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 1 ms to minimize.
[2023-03-16 01:10:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1146 ms
[2023-03-16 01:10:05] [INFO ] After 1253ms 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-16 01:10:05] [INFO ] After 1575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 953267 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 953267 steps, saw 138850 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:08] [INFO ] Invariant cache hit.
[2023-03-16 01:10:08] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:10:08] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:09] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:09] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-16 01:10:09] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2023-03-16 01:10:09] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2023-03-16 01:10:09] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-16 01:10:09] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-16 01:10:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 815 ms
[2023-03-16 01:10:09] [INFO ] After 885ms 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-16 01:10:09] [INFO ] After 1196ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:09] [INFO ] Invariant cache hit.
[2023-03-16 01:10:10] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-16 01:10:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:10] [INFO ] Invariant cache hit.
[2023-03-16 01:10:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:11] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2023-03-16 01:10:11] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:10:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:11] [INFO ] Invariant cache hit.
[2023-03-16 01:10:12] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2874 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:10:12] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:10:12] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:10:12] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 887754 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 887754 steps, saw 130020 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:15] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:10:15] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:10:16] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:16] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:16] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-16 01:10:16] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 971901 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 971901 steps, saw 142226 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:19] [INFO ] Invariant cache hit.
[2023-03-16 01:10:19] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:10:19] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:19] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:19] [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 31 ms.
[2023-03-16 01:10:19] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:19] [INFO ] Invariant cache hit.
[2023-03-16 01:10:20] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-16 01:10:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:20] [INFO ] Invariant cache hit.
[2023-03-16 01:10:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:21] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-16 01:10:21] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:10:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:21] [INFO ] Invariant cache hit.
[2023-03-16 01:10:22] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2770 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:10:22] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:10:22] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:22] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:10:22] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1003821 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003821 steps, saw 146849 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:25] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:10:25] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:10:26] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:26] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:26] [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 22 ms.
[2023-03-16 01:10:26] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 948493 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 948493 steps, saw 138653 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:29] [INFO ] Invariant cache hit.
[2023-03-16 01:10:29] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:10:29] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:29] [INFO ] After 68ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:29] [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 32 ms.
[2023-03-16 01:10:29] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:29] [INFO ] Invariant cache hit.
[2023-03-16 01:10:30] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-16 01:10:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:30] [INFO ] Invariant cache hit.
[2023-03-16 01:10:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:31] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2023-03-16 01:10:31] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:10:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:31] [INFO ] Invariant cache hit.
[2023-03-16 01:10:31] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2100 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:10:32] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:10:32] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:32] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:10:32] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030708 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030708 steps, saw 149786 distinct states, run finished after 3002 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:35] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:10:35] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:10:35] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:35] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:35] [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 27 ms.
[2023-03-16 01:10:35] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1034201 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1034201 steps, saw 149936 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:38] [INFO ] Invariant cache hit.
[2023-03-16 01:10:38] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:10:38] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:38] [INFO ] After 54ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:38] [INFO ] After 88ms 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-16 01:10:39] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:39] [INFO ] Invariant cache hit.
[2023-03-16 01:10:39] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-16 01:10:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:39] [INFO ] Invariant cache hit.
[2023-03-16 01:10:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:40] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2023-03-16 01:10:40] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:10:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:40] [INFO ] Invariant cache hit.
[2023-03-16 01:10:41] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2079 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:10:41] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:10:41] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:41] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:10:41] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1033557 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1033557 steps, saw 149788 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:44] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:10:44] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-16 01:10:44] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:44] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:44] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-16 01:10:44] [INFO ] After 565ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 899423 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899423 steps, saw 131594 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:47] [INFO ] Invariant cache hit.
[2023-03-16 01:10:47] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:10:48] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:48] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:48] [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 40 ms.
[2023-03-16 01:10:48] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:48] [INFO ] Invariant cache hit.
[2023-03-16 01:10:48] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-16 01:10:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:48] [INFO ] Invariant cache hit.
[2023-03-16 01:10:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:50] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-16 01:10:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:10:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:50] [INFO ] Invariant cache hit.
[2023-03-16 01:10:50] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2326 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 8 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:50] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-16 01:10:50] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:10:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:10:50] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 984410 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984410 steps, saw 143450 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:10:53] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:10:53] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:10:54] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:54] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:54] [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 20 ms.
[2023-03-16 01:10:54] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1017373 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1017373 steps, saw 148653 distinct states, run finished after 3005 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:10:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:57] [INFO ] Invariant cache hit.
[2023-03-16 01:10:57] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:10:57] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:57] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:57] [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 20 ms.
[2023-03-16 01:10:57] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:10:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:57] [INFO ] Invariant cache hit.
[2023-03-16 01:10:58] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-16 01:10:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:58] [INFO ] Invariant cache hit.
[2023-03-16 01:10:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:10:59] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2023-03-16 01:10:59] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:10:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:10:59] [INFO ] Invariant cache hit.
[2023-03-16 01:10:59] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1952 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:10:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:10:59] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:10:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:10:59] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:10:59] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:10:59] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 967393 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967393 steps, saw 141513 distinct states, run finished after 3004 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:02] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:11:02] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:11:03] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:03] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:03] [INFO ] After 80ms 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-16 01:11:03] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026984 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026984 steps, saw 149590 distinct states, run finished after 3003 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:06] [INFO ] Invariant cache hit.
[2023-03-16 01:11:06] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:11:06] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:06] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:06] [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 20 ms.
[2023-03-16 01:11:06] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:06] [INFO ] Invariant cache hit.
[2023-03-16 01:11:07] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-16 01:11:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:07] [INFO ] Invariant cache hit.
[2023-03-16 01:11:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:08] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2023-03-16 01:11:08] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:11:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:08] [INFO ] Invariant cache hit.
[2023-03-16 01:11:09] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2312 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:11:09] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:11:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:09] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:11:09] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 947170 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947170 steps, saw 138527 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:12] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:11:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:11:12] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:12] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:12] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 01:11:12] [INFO ] After 375ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 967106 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967106 steps, saw 141489 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:15] [INFO ] Invariant cache hit.
[2023-03-16 01:11:15] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:11:16] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:16] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:16] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-16 01:11:16] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:16] [INFO ] Invariant cache hit.
[2023-03-16 01:11:16] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-16 01:11:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:16] [INFO ] Invariant cache hit.
[2023-03-16 01:11:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:17] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2023-03-16 01:11:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:11:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:17] [INFO ] Invariant cache hit.
[2023-03-16 01:11:18] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2147 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:11:18] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:11:18] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:18] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:11:18] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 993167 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 993167 steps, saw 143967 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:21] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:11:21] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:11:21] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:21] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:21] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-16 01:11:21] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1035762 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1035762 steps, saw 150880 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:24] [INFO ] Invariant cache hit.
[2023-03-16 01:11:25] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:11:25] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:25] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:25] [INFO ] After 88ms 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-16 01:11:25] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:25] [INFO ] Invariant cache hit.
[2023-03-16 01:11:25] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-16 01:11:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:25] [INFO ] Invariant cache hit.
[2023-03-16 01:11:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:26] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2023-03-16 01:11:26] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:11:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:26] [INFO ] Invariant cache hit.
[2023-03-16 01:11:27] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1977 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:11:27] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:11:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:27] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:11:27] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1003415 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003415 steps, saw 146805 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:30] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:11:30] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:11:30] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:30] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:30] [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 19 ms.
[2023-03-16 01:11:30] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1031695 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1031695 steps, saw 149786 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:33] [INFO ] Invariant cache hit.
[2023-03-16 01:11:34] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-16 01:11:34] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:34] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:34] [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 20 ms.
[2023-03-16 01:11:34] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:34] [INFO ] Invariant cache hit.
[2023-03-16 01:11:34] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-16 01:11:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:34] [INFO ] Invariant cache hit.
[2023-03-16 01:11:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:36] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2023-03-16 01:11:36] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:11:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:36] [INFO ] Invariant cache hit.
[2023-03-16 01:11:36] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2485 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 6 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:11:36] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:11:36] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:36] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:11:36] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 986888 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 986888 steps, saw 143692 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:39] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:11:40] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:11:40] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:40] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:40] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:11:40] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 966805 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 966805 steps, saw 141458 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:43] [INFO ] Invariant cache hit.
[2023-03-16 01:11:43] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:11:43] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:43] [INFO ] After 50ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:43] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-16 01:11:43] [INFO ] After 408ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:44] [INFO ] Invariant cache hit.
[2023-03-16 01:11:44] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-16 01:11:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:44] [INFO ] Invariant cache hit.
[2023-03-16 01:11:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:45] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2023-03-16 01:11:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:11:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:45] [INFO ] Invariant cache hit.
[2023-03-16 01:11:46] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2337 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 9 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:11:46] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:11:46] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:46] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:11:46] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 972307 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 972307 steps, saw 142267 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:49] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:11:49] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:11:49] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:49] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:49] [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 18 ms.
[2023-03-16 01:11:49] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1093953 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1093953 steps, saw 159129 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:52] [INFO ] Invariant cache hit.
[2023-03-16 01:11:52] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-16 01:11:53] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:53] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:53] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:11:53] [INFO ] After 375ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:11:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:53] [INFO ] Invariant cache hit.
[2023-03-16 01:11:53] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-16 01:11:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:53] [INFO ] Invariant cache hit.
[2023-03-16 01:11:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:55] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-16 01:11:55] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:11:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:11:55] [INFO ] Invariant cache hit.
[2023-03-16 01:11:55] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2463 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:11:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:11:55] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:11:55] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:55] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:11:55] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1025542 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025542 steps, saw 149455 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:11:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:11:58] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:11:58] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:11:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:11:59] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:11:59] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:11:59] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 01:11:59] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048418 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048418 steps, saw 153233 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:02] [INFO ] Invariant cache hit.
[2023-03-16 01:12:02] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:02] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:02] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:02] [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 19 ms.
[2023-03-16 01:12:02] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:02] [INFO ] Invariant cache hit.
[2023-03-16 01:12:03] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-16 01:12:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:03] [INFO ] Invariant cache hit.
[2023-03-16 01:12:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:04] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2023-03-16 01:12:04] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 01:12:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:04] [INFO ] Invariant cache hit.
[2023-03-16 01:12:04] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1809 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 178 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 198
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 61 place count 80 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 131 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 2 transition count 2
Applied a total of 156 rules in 7 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:12:04] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:12:04] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:04] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:12:04] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 952672 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952672 steps, saw 138850 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:07] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:12:07] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:12:08] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:08] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:08] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:12:08] [INFO ] After 543ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1028972 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1028972 steps, saw 149785 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:11] [INFO ] Invariant cache hit.
[2023-03-16 01:12:11] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:11] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:11] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:11] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 01:12:11] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:11] [INFO ] Invariant cache hit.
[2023-03-16 01:12:12] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-16 01:12:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:12] [INFO ] Invariant cache hit.
[2023-03-16 01:12:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:13] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2023-03-16 01:12:13] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:12:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:13] [INFO ] Invariant cache hit.
[2023-03-16 01:12:14] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2336 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 20 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:12:14] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:12:14] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:14] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:12:14] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1006019 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1006019 steps, saw 147066 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:17] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 01:12:17] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 01:12:17] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:17] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:17] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 0 ms to minimize.
[2023-03-16 01:12:18] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-16 01:12:18] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:12:18] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:12:18] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 0 ms to minimize.
[2023-03-16 01:12:19] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-16 01:12:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1549 ms
[2023-03-16 01:12:19] [INFO ] After 1637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:12:19] [INFO ] After 2052ms 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 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 899017 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899017 steps, saw 131555 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:22] [INFO ] Invariant cache hit.
[2023-03-16 01:12:22] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:22] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:22] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:23] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 0 ms to minimize.
[2023-03-16 01:12:23] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 1 ms to minimize.
[2023-03-16 01:12:23] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:12:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 805 ms
[2023-03-16 01:12:23] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 01:12:23] [INFO ] After 1159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:23] [INFO ] Invariant cache hit.
[2023-03-16 01:12:24] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-16 01:12:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:24] [INFO ] Invariant cache hit.
[2023-03-16 01:12:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:25] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2023-03-16 01:12:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:12:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:25] [INFO ] Invariant cache hit.
[2023-03-16 01:12:26] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2542 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:12:26] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:12:26] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:26] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:12:26] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1042713 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1042713 steps, saw 152333 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:29] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:12:29] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:29] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:29] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:29] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 01:12:29] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1025906 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025906 steps, saw 149493 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:32] [INFO ] Invariant cache hit.
[2023-03-16 01:12:32] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-16 01:12:33] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:33] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:33] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 01:12:33] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:33] [INFO ] Invariant cache hit.
[2023-03-16 01:12:33] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-16 01:12:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:33] [INFO ] Invariant cache hit.
[2023-03-16 01:12:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:35] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-16 01:12:35] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 01:12:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:35] [INFO ] Invariant cache hit.
[2023-03-16 01:12:35] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 6 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:35] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:12:35] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:12:35] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:35] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:12:35] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1071084 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1071084 steps, saw 155067 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:38] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:12:38] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:38] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:38] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:39] [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 31 ms.
[2023-03-16 01:12:39] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 945819 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 945819 steps, saw 138431 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:42] [INFO ] Invariant cache hit.
[2023-03-16 01:12:42] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:42] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:42] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:42] [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 23 ms.
[2023-03-16 01:12:42] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:42] [INFO ] Invariant cache hit.
[2023-03-16 01:12:42] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-16 01:12:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:42] [INFO ] Invariant cache hit.
[2023-03-16 01:12:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:44] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
[2023-03-16 01:12:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:12:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:44] [INFO ] Invariant cache hit.
[2023-03-16 01:12:44] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2297 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 11 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:12:44] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:12:44] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:44] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:12:44] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1021286 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1021286 steps, saw 149069 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:47] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 01:12:48] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:48] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:48] [INFO ] After 57ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:48] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-16 01:12:48] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 962927 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 962927 steps, saw 140872 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:51] [INFO ] Invariant cache hit.
[2023-03-16 01:12:51] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:51] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:51] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:51] [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 20 ms.
[2023-03-16 01:12:51] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:12:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:51] [INFO ] Invariant cache hit.
[2023-03-16 01:12:52] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-16 01:12:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:52] [INFO ] Invariant cache hit.
[2023-03-16 01:12:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:53] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2023-03-16 01:12:53] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 01:12:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:12:53] [INFO ] Invariant cache hit.
[2023-03-16 01:12:53] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1969 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 18 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:12:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:12:53] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:12:53] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:53] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:12:53] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 899430 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899430 steps, saw 131597 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:12:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:12:57] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:12:57] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:12:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:12:57] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:12:57] [INFO ] After 57ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:12:57] [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 26 ms.
[2023-03-16 01:12:57] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970109 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970109 steps, saw 141935 distinct states, run finished after 3004 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:00] [INFO ] Invariant cache hit.
[2023-03-16 01:13:00] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:00] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:00] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:00] [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 29 ms.
[2023-03-16 01:13:00] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:13:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:00] [INFO ] Invariant cache hit.
[2023-03-16 01:13:01] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-16 01:13:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:01] [INFO ] Invariant cache hit.
[2023-03-16 01:13:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:02] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-16 01:13:02] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:13:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:02] [INFO ] Invariant cache hit.
[2023-03-16 01:13:03] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:13:03] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 01:13:03] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:13:03] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:03] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:13:03] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1000762 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000762 steps, saw 145777 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:13:06] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:13:06] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:07] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:07] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:07] [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 20 ms.
[2023-03-16 01:13:07] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1073205 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :{}
Probabilistic random walk after 1073205 steps, saw 155496 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:10] [INFO ] Invariant cache hit.
[2023-03-16 01:13:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:10] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:10] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:10] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-16 01:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-16 01:13:10] [INFO ] After 209ms 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-16 01:13:10] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:13:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:10] [INFO ] Invariant cache hit.
[2023-03-16 01:13:11] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-16 01:13:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:11] [INFO ] Invariant cache hit.
[2023-03-16 01:13:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:12] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-16 01:13:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 01:13:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:12] [INFO ] Invariant cache hit.
[2023-03-16 01:13:13] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2602 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:13:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:13:13] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:13:13] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:13] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:13:13] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 997885 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997885 steps, saw 144612 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:13:16] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:13:16] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:16] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:16] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:16] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 01:13:16] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 940709 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940709 steps, saw 137779 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:19] [INFO ] Invariant cache hit.
[2023-03-16 01:13:20] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:20] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:20] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:20] [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 30 ms.
[2023-03-16 01:13:20] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-16 01:13:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:20] [INFO ] Invariant cache hit.
[2023-03-16 01:13:20] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-16 01:13:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:20] [INFO ] Invariant cache hit.
[2023-03-16 01:13:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:22] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2023-03-16 01:13:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 01:13:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-16 01:13:22] [INFO ] Invariant cache hit.
[2023-03-16 01:13:23] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2817 ms. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 179 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 33 rules applied. Total rules applied 128 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 153 place count 2 transition count 2
Applied a total of 153 rules in 8 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 01:13:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 01:13:23] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:23] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:23] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 01:13:23] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 963088 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 963088 steps, saw 140918 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:13:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-16 01:13:26] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-16 01:13:26] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:13:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-16 01:13:26] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 01:13:26] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:13:26] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-16 01:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-16 01:13:26] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-16 01:13:26] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14957548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16123368 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 Liveness -timeout 180 -rebuildPNML