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

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

=== Now, execution of the tool begins

BK_START 1678884042196

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 12:40:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 12:40:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:40:45] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-15 12:40:45] [INFO ] Transformed 834 places.
[2023-03-15 12:40:45] [INFO ] Transformed 1242 transitions.
[2023-03-15 12:40:45] [INFO ] Found NUPN structural information;
[2023-03-15 12:40:45] [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-15 12:40:45] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 322 ms.
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 3 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 2 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 106 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2023-03-15 12:40:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-03-15 12:40:45] [INFO ] Computed 23 place invariants in 36 ms
[2023-03-15 12:40:46] [INFO ] Implicit Places using invariants in 630 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 673 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 9 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 788 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 1054 ms. (steps per millisecond=9 ) properties (out of 666) seen :296
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 370) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 370) 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 368) 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 368) 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 368) 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 368) 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 367) 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 367) 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 367) 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 367) 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 367) 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 367) 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 367) 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 367) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 366) 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 366) 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 366) 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 366) 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 365) 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 365) 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 365) 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 365) 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 365) 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 365) 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 365) 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 365) 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 365) 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 364) 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 364) 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 364) 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 364) 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 364) 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 364) 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 364) 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 364) 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 364) 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 364) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 362) 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 362) 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 362) 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 362) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) 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 361) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) 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 359) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 359) 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 359) 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 359) 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 359) 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 359) 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 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 :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 :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 :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 :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 :0
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 :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 :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 :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 :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 358) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 357) 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 357) 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 357) 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 357) 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 357) 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 357) 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 357) 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 357) 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 356) 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 356) 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 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 1 ms. (steps per millisecond=100 ) 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 4 ms. (steps per millisecond=25 ) properties (out of 354) 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 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 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 4 ms. (steps per millisecond=25 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) 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 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 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 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 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 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 1 ms. (steps per millisecond=100 ) 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 1 ms. (steps per millisecond=100 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) 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 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 1 ms. (steps per millisecond=100 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) 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 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 1 ms. (steps per millisecond=100 ) 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 1 ms. (steps per millisecond=100 ) 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 :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 352) 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 351) 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 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 351) 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 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 351) 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 351) 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 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 351) 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 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 350) 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 350) 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 350) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 350) 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 350) 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 350) 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 350) 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 350) 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 350) 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 350) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) 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 349) seen :0
Running SMT prover for 349 properties.
[2023-03-15 12:40:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 12:40:47] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-15 12:40:51] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 12:41:06] [INFO ] After 18358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:349
[2023-03-15 12:41:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 12:41:22] [INFO ] After 10518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :349
[2023-03-15 12:41:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:41:31] [INFO ] After 8450ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :349
[2023-03-15 12:41:31] [INFO ] After 8454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :349
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 12:41:31] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :349
Fused 349 Parikh solutions to 340 different solutions.
Parikh walk visited 21 properties in 6036 ms.
Support contains 211 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 36 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 36 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 472303 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 276) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 265) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 245) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 241) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 240) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 232) 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 232) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 230) 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 230) 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 230) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 228) 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 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 228) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 228) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 222) 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 222) 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 222) 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 222) 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 222) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 220) 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 220) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 217) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 216) 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 216) 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 216) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 215) 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 215) 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 215) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 213) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 212) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 210) 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 210) 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 210) 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 210) 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 209) 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 208) 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 208) 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 208) 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 208) 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 208) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) 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 205) seen :2
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 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 68 ms. (steps per millisecond=147 ) 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 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 73 ms. (steps per millisecond=137 ) 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 70 ms. (steps per millisecond=142 ) 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 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 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 73 ms. (steps per millisecond=137 ) 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 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 76 ms. (steps per millisecond=131 ) 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 68 ms. (steps per millisecond=147 ) properties (out of 203) 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 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 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 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 73 ms. (steps per millisecond=137 ) 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 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 73 ms. (steps per millisecond=137 ) properties (out of 203) 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 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 70 ms. (steps per millisecond=142 ) 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 68 ms. (steps per millisecond=147 ) properties (out of 203) 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 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 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 73 ms. (steps per millisecond=137 ) 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 76 ms. (steps per millisecond=131 ) 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 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 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 70 ms. (steps per millisecond=142 ) 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 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 75 ms. (steps per millisecond=133 ) properties (out of 203) seen :0
Running SMT prover for 203 properties.
[2023-03-15 12:42:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:42:15] [INFO ] Invariant cache hit.
[2023-03-15 12:42:17] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 12:42:23] [INFO ] After 4573ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:187
[2023-03-15 12:42:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:42:23] [INFO ] After 433ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 12:42:23] [INFO ] After 7651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 12:42:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 12:42:32] [INFO ] After 6110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :203
[2023-03-15 12:42:39] [INFO ] After 6676ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :203
[2023-03-15 12:42:39] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 12 ms to minimize.
[2023-03-15 12:42:39] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 2 ms to minimize.
[2023-03-15 12:42:40] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 2 ms to minimize.
[2023-03-15 12:42:40] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 2 ms to minimize.
[2023-03-15 12:42:40] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 2 ms to minimize.
[2023-03-15 12:42:41] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 2 ms to minimize.
[2023-03-15 12:42:41] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
[2023-03-15 12:42:41] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 2 ms to minimize.
[2023-03-15 12:42:42] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-15 12:42:42] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2023-03-15 12:42:42] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:42:42] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:42:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3698 ms
[2023-03-15 12:42:43] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-15 12:42:43] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 2 ms to minimize.
[2023-03-15 12:42:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2023-03-15 12:42:43] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:42:43] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:42:44] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:42:44] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:42:44] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2023-03-15 12:42:44] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-15 12:42:45] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2023-03-15 12:42:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1456 ms
[2023-03-15 12:42:45] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 2 ms to minimize.
[2023-03-15 12:42:45] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 2 ms to minimize.
[2023-03-15 12:42:45] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 1 ms to minimize.
[2023-03-15 12:42:46] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 3 ms to minimize.
[2023-03-15 12:42:46] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2023-03-15 12:42:46] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2023-03-15 12:42:46] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:42:47] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 2 ms to minimize.
[2023-03-15 12:42:47] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-15 12:42:47] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-15 12:42:47] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-15 12:42:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2673 ms
[2023-03-15 12:42:48] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2023-03-15 12:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 12:42:48] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 2 ms to minimize.
[2023-03-15 12:42:48] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 5 ms to minimize.
[2023-03-15 12:42:49] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2023-03-15 12:42:49] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2023-03-15 12:42:49] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 0 ms to minimize.
[2023-03-15 12:42:49] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 0 ms to minimize.
[2023-03-15 12:42:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1600 ms
[2023-03-15 12:42:50] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2023-03-15 12:42:50] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2023-03-15 12:42:50] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-15 12:42:50] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:42:50] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:42:51] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2023-03-15 12:42:52] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:42:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2351 ms
[2023-03-15 12:42:52] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:42:52] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-15 12:42:53] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 1 ms to minimize.
[2023-03-15 12:42:53] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:42:53] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 2 ms to minimize.
[2023-03-15 12:42:53] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 1 ms to minimize.
[2023-03-15 12:42:54] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2023-03-15 12:42:54] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 1 ms to minimize.
[2023-03-15 12:42:54] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2023-03-15 12:42:54] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:42:55] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2023-03-15 12:42:55] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 1 ms to minimize.
[2023-03-15 12:42:55] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 2 ms to minimize.
[2023-03-15 12:42:55] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2023-03-15 12:42:56] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 1 ms to minimize.
[2023-03-15 12:42:56] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 1 ms to minimize.
[2023-03-15 12:42:56] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2023-03-15 12:42:56] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-15 12:42:57] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-15 12:42:57] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 1 ms to minimize.
[2023-03-15 12:42:57] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 0 ms to minimize.
[2023-03-15 12:42:57] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 0 ms to minimize.
[2023-03-15 12:42:58] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-15 12:42:58] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-15 12:42:58] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 1 ms to minimize.
[2023-03-15 12:42:58] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 1 ms to minimize.
[2023-03-15 12:42:59] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 0 ms to minimize.
[2023-03-15 12:42:59] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2023-03-15 12:42:59] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2023-03-15 12:43:00] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 0 ms to minimize.
[2023-03-15 12:43:00] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 2 ms to minimize.
[2023-03-15 12:43:00] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 1 ms to minimize.
[2023-03-15 12:43:00] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 0 ms to minimize.
[2023-03-15 12:43:00] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8508 ms
[2023-03-15 12:43:00] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2023-03-15 12:43:01] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-15 12:43:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-15 12:43:01] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-15 12:43:01] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-15 12:43:01] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:43:02] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 0 ms to minimize.
[2023-03-15 12:43:02] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2023-03-15 12:43:02] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-15 12:43:02] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:43:02] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:43:03] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 0 ms to minimize.
[2023-03-15 12:43:03] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2023-03-15 12:43:03] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:43:03] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2023-03-15 12:43:04] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-15 12:43:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-15 12:43:05] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3900 ms
[2023-03-15 12:43:05] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 0 ms to minimize.
[2023-03-15 12:43:05] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-15 12:43:05] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:43:06] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:43:06] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 0 ms to minimize.
[2023-03-15 12:43:06] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-15 12:43:06] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 1 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 0 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 0 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:43:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2784 ms
[2023-03-15 12:43:08] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
[2023-03-15 12:43:08] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-15 12:43:08] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:43:09] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2023-03-15 12:43:09] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:43:09] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 1 ms to minimize.
[2023-03-15 12:43:10] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2023-03-15 12:43:10] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 0 ms to minimize.
[2023-03-15 12:43:10] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2023-03-15 12:43:10] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 1 ms to minimize.
[2023-03-15 12:43:10] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:43:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3003 ms
[2023-03-15 12:43:11] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 1 ms to minimize.
[2023-03-15 12:43:11] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2023-03-15 12:43:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-15 12:43:12] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-15 12:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 12:43:12] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-15 12:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 12:43:12] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2023-03-15 12:43:12] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 1 ms to minimize.
[2023-03-15 12:43:13] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 1 ms to minimize.
[2023-03-15 12:43:13] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-15 12:43:13] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:43:14] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-15 12:43:14] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:43:14] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-15 12:43:14] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:43:14] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:43:15] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 3 ms to minimize.
[2023-03-15 12:43:15] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2023-03-15 12:43:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2718 ms
[2023-03-15 12:43:15] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2023-03-15 12:43:15] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:43:16] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:43:16] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:43:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 632 ms
[2023-03-15 12:43:16] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-15 12:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 12:43:16] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:43:17] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:43:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-15 12:43:18] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:43:18] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-15 12:43:18] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:43:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 626 ms
[2023-03-15 12:43:18] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 0 ms to minimize.
[2023-03-15 12:43:19] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:43:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-03-15 12:43:19] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:43:19] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:43:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2023-03-15 12:43:20] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:43:21] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
[2023-03-15 12:43:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 557 ms
[2023-03-15 12:43:21] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 12:43:21] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2023-03-15 12:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 12:43:22] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 0 ms to minimize.
[2023-03-15 12:43:22] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:43:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2023-03-15 12:43:23] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-15 12:43:23] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:43:23] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-15 12:43:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 840 ms
[2023-03-15 12:43:24] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:43:24] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-15 12:43:24] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2023-03-15 12:43:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 541 ms
[2023-03-15 12:43:25] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-15 12:43:26] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-15 12:43:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2023-03-15 12:43:26] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-15 12:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 12:43:27] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 1 ms to minimize.
[2023-03-15 12:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 12:43:27] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-15 12:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-15 12:43:28] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-15 12:43:29] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 12:43:29] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2023-03-15 12:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-15 12:43:30] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 1 ms to minimize.
[2023-03-15 12:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-15 12:43:30] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 0 ms to minimize.
[2023-03-15 12:43:30] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:43:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2023-03-15 12:43:31] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 12:43:31] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 0 ms to minimize.
[2023-03-15 12:43:31] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:43:32] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:43:32] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2023-03-15 12:43:32] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2023-03-15 12:43:32] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:43:33] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-15 12:43:33] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-15 12:43:33] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:43:33] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2023-03-15 12:43:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2282 ms
[2023-03-15 12:43:33] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-15 12:43:34] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-15 12:43:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2023-03-15 12:43:34] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-15 12:43:35] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2023-03-15 12:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-15 12:43:35] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:43:36] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:43:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-15 12:43:38] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 1 ms to minimize.
[2023-03-15 12:43:38] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:43:38] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2023-03-15 12:43:39] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-15 12:43:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1131 ms
[2023-03-15 12:43:40] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2023-03-15 12:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-15 12:43:40] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2023-03-15 12:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-15 12:43:42] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2023-03-15 12:43:42] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2023-03-15 12:43:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2023-03-15 12:43:42] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 0 ms to minimize.
[2023-03-15 12:43:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-15 12:43:42] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 12:43:43] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-15 12:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 12:43:44] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-15 12:43:44] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:43:45] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-15 12:43:45] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 1 ms to minimize.
[2023-03-15 12:43:45] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:43:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1212 ms
[2023-03-15 12:43:45] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-15 12:43:46] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 12:43:48] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:43:48] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:43:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2023-03-15 12:43:49] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-15 12:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-15 12:43:49] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 12:43:51] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 1 ms to minimize.
[2023-03-15 12:43:51] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 1 ms to minimize.
[2023-03-15 12:43:52] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 1 ms to minimize.
[2023-03-15 12:43:52] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:43:52] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:43:52] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 0 ms to minimize.
[2023-03-15 12:43:52] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:43:53] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 1 ms to minimize.
[2023-03-15 12:43:53] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:43:53] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 0 ms to minimize.
[2023-03-15 12:43:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2540 ms
[2023-03-15 12:43:55] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-15 12:43:55] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:43:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-15 12:43:55] [INFO ] After 83246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :203
Attempting to minimize the solution found.
Minimization took 18310 ms.
[2023-03-15 12:44:14] [INFO ] After 110422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :203
Fused 203 Parikh solutions to 197 different solutions.
Parikh walk visited 0 properties in 1672 ms.
Support contains 162 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 35 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 35 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 712745 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties 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 60 ms. (steps per millisecond=166 ) 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 60 ms. (steps per millisecond=166 ) 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 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 60 ms. (steps per millisecond=166 ) 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 60 ms. (steps per millisecond=166 ) properties (out of 203) 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 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 57 ms. (steps per millisecond=175 ) 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 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 61 ms. (steps per millisecond=163 ) 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 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 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 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 57 ms. (steps per millisecond=175 ) properties (out of 203) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 203) 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 203) 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 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 :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 88 ms. (steps per millisecond=113 ) properties (out of 203) 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 203) 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 203) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 203) 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 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 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 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 62 ms. (steps per millisecond=161 ) 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 57 ms. (steps per millisecond=175 ) 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 61 ms. (steps per millisecond=163 ) properties (out of 203) seen :0
Interrupted probabilistic random walk after 9448271 steps, run timeout after 99001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 9448271 steps, saw 1350738 distinct states, run finished after 99007 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 203 properties.
[2023-03-15 12:46:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:46:28] [INFO ] Invariant cache hit.
[2023-03-15 12:46:29] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 12:46:35] [INFO ] After 4489ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:187
[2023-03-15 12:46:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:46:36] [INFO ] After 434ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 12:46:36] [INFO ] After 7816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:203
[2023-03-15 12:46:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 12:46:42] [INFO ] After 3664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :203
[2023-03-15 12:46:46] [INFO ] After 4078ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :203
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1957 ms
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 996 ms
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1553 ms
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 880 ms
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1474 ms
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 0 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 1 ms to minimize.
[2023-03-15 12:46:55] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-15 12:46:56] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 1 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 0 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:46:57] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5014 ms
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-15 12:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:46:59] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2023-03-15 12:47:00] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2351 ms
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:47:01] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:47:02] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1615 ms
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1741 ms
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1776 ms
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:47:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-15 12:47:10] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:47:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 1 ms to minimize.
[2023-03-15 12:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 12:47:12] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:47:12] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 0 ms to minimize.
[2023-03-15 12:47:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2023-03-15 12:47:13] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:47:13] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-15 12:47:13] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2023-03-15 12:47:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2023-03-15 12:47:14] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:47:14] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-15 12:47:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:47:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-15 12:47:15] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2023-03-15 12:47:15] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2023-03-15 12:47:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-03-15 12:47:16] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-15 12:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-15 12:47:16] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-15 12:47:17] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-15 12:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 12:47:17] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 12:47:18] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2023-03-15 12:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 12:47:18] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 0 ms to minimize.
[2023-03-15 12:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-15 12:47:19] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2023-03-15 12:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-15 12:47:19] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:47:19] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2023-03-15 12:47:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2023-03-15 12:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:47:20] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-15 12:47:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1868 ms
[2023-03-15 12:47:22] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-15 12:47:22] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 1 ms to minimize.
[2023-03-15 12:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2023-03-15 12:47:22] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:47:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-15 12:47:23] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 0 ms to minimize.
[2023-03-15 12:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-15 12:47:23] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2023-03-15 12:47:23] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:47:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-15 12:47:25] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2023-03-15 12:47:25] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2023-03-15 12:47:25] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:47:25] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:47:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 763 ms
[2023-03-15 12:47:26] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 0 ms to minimize.
[2023-03-15 12:47:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-15 12:47:27] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2023-03-15 12:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 12:47:27] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2023-03-15 12:47:28] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2023-03-15 12:47:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2023-03-15 12:47:28] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 1 ms to minimize.
[2023-03-15 12:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 12:47:28] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 0 ms to minimize.
[2023-03-15 12:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 12:47:29] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 0 ms to minimize.
[2023-03-15 12:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 12:47:30] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-15 12:47:30] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 0 ms to minimize.
[2023-03-15 12:47:30] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 1 ms to minimize.
[2023-03-15 12:47:30] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 1 ms to minimize.
[2023-03-15 12:47:31] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2023-03-15 12:47:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1171 ms
[2023-03-15 12:47:31] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 0 ms to minimize.
[2023-03-15 12:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-15 12:47:31] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2023-03-15 12:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 12:47:33] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:47:33] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2023-03-15 12:47:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-03-15 12:47:34] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-15 12:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-15 12:47:34] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-15 12:47:36] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:47:36] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:47:36] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:47:36] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2023-03-15 12:47:36] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:47:37] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2023-03-15 12:47:37] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2023-03-15 12:47:37] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2023-03-15 12:47:37] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:47:38] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:47:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1928 ms
[2023-03-15 12:47:39] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-03-15 12:47:39] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-03-15 12:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-03-15 12:47:39] [INFO ] After 57456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :203
Attempting to minimize the solution found.
Minimization took 17443 ms.
[2023-03-15 12:47:56] [INFO ] After 80906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :203
Fused 203 Parikh solutions to 197 different solutions.
Parikh walk visited 0 properties in 1487 ms.
Support contains 162 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 19 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 19 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 18 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 12:47:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:47:58] [INFO ] Invariant cache hit.
[2023-03-15 12:47:58] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-15 12:47:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:47:58] [INFO ] Invariant cache hit.
[2023-03-15 12:47:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:47:59] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2023-03-15 12:47:59] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-15 12:47:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:47:59] [INFO ] Invariant cache hit.
[2023-03-15 12:48:00] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1704 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4315 ms. (steps per millisecond=23 ) properties (out of 162) seen :68
Running SMT prover for 94 properties.
[2023-03-15 12:48:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:48:04] [INFO ] Invariant cache hit.
[2023-03-15 12:48:04] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 12:48:05] [INFO ] After 391ms SMT Verify possible using state equation in real domain returned unsat :0 sat :94
[2023-03-15 12:48:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:48:05] [INFO ] After 409ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :94
[2023-03-15 12:48:05] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:48:05] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 0 ms to minimize.
[2023-03-15 12:48:06] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2023-03-15 12:48:06] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 0 ms to minimize.
[2023-03-15 12:48:06] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2023-03-15 12:48:06] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:48:07] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-15 12:48:07] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 0 ms to minimize.
[2023-03-15 12:48:07] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:48:07] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:48:07] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 1 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2927 ms
[2023-03-15 12:48:08] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 1 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 12:48:08] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2023-03-15 12:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-15 12:48:09] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:48:09] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2023-03-15 12:48:09] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 1 ms to minimize.
[2023-03-15 12:48:09] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 1 ms to minimize.
[2023-03-15 12:48:10] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:48:10] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 2 ms to minimize.
[2023-03-15 12:48:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1221 ms
[2023-03-15 12:48:10] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2023-03-15 12:48:10] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 0 ms to minimize.
[2023-03-15 12:48:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2023-03-15 12:48:11] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-15 12:48:11] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:48:11] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:48:11] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 595 ms
[2023-03-15 12:48:12] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:48:12] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2023-03-15 12:48:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2023-03-15 12:48:12] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-15 12:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-15 12:48:13] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-03-15 12:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-15 12:48:13] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-15 12:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 12:48:14] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:48:14] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 0 ms to minimize.
[2023-03-15 12:48:14] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:48:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 643 ms
[2023-03-15 12:48:15] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2023-03-15 12:48:15] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2023-03-15 12:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-15 12:48:15] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-15 12:48:16] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2023-03-15 12:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-15 12:48:16] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2023-03-15 12:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-15 12:48:16] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:48:16] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 0 ms to minimize.
[2023-03-15 12:48:16] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:48:17] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 0 ms to minimize.
[2023-03-15 12:48:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2023-03-15 12:48:17] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 9 ms to minimize.
[2023-03-15 12:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 12:48:18] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-15 12:48:19] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 0 ms to minimize.
[2023-03-15 12:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 12:48:19] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 0 ms to minimize.
[2023-03-15 12:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 12:48:20] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 1 ms to minimize.
[2023-03-15 12:48:20] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:48:20] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2023-03-15 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2023-03-15 12:48:20] [INFO ] After 15407ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:94
[2023-03-15 12:48:20] [INFO ] After 15990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:94
[2023-03-15 12:48:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 12:48:21] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :94
[2023-03-15 12:48:21] [INFO ] After 452ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :94
[2023-03-15 12:48:21] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:48:21] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2023-03-15 12:48:22] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-15 12:48:23] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:48:23] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 0 ms to minimize.
[2023-03-15 12:48:23] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:48:23] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:48:23] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:48:24] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:48:24] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:48:24] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2023-03-15 12:48:24] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2745 ms
[2023-03-15 12:48:24] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-15 12:48:24] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:48:25] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2023-03-15 12:48:25] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 0 ms to minimize.
[2023-03-15 12:48:25] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 0 ms to minimize.
[2023-03-15 12:48:25] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:48:25] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 1 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:48:26] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-15 12:48:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3468 ms
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:48:28] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:48:29] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2023-03-15 12:48:29] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:48:29] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:48:29] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:48:29] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2023-03-15 12:48:30] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2023-03-15 12:48:30] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:48:30] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:48:30] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2023-03-15 12:48:30] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-15 12:48:31] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3663 ms
[2023-03-15 12:48:31] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 472 ms
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-15 12:48:32] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-15 12:48:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1462 ms
[2023-03-15 12:48:33] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:48:34] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2023-03-15 12:48:34] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:48:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2023-03-15 12:48:34] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2023-03-15 12:48:34] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-15 12:48:35] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:48:35] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2023-03-15 12:48:35] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 1 ms to minimize.
[2023-03-15 12:48:35] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-15 12:48:35] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-15 12:48:36] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:48:36] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 0 ms to minimize.
[2023-03-15 12:48:36] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2023-03-15 12:48:36] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:48:37] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:48:37] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:48:37] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:48:37] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:48:37] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4078 ms
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:38] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-15 12:48:39] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-15 12:48:39] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2023-03-15 12:48:39] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2023-03-15 12:48:39] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 0 ms to minimize.
[2023-03-15 12:48:39] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-15 12:48:40] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2023-03-15 12:48:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2023-03-15 12:48:40] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2023-03-15 12:48:40] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-15 12:48:40] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-15 12:48:40] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:48:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1755 ms
[2023-03-15 12:48:42] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2023-03-15 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 12:48:42] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:48:42] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:48:42] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:42] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-15 12:48:43] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:48:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 833 ms
[2023-03-15 12:48:43] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2023-03-15 12:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-15 12:48:43] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-15 12:48:44] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-15 12:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-15 12:48:44] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-15 12:48:44] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2023-03-15 12:48:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-15 12:48:44] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-15 12:48:44] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 605 ms
[2023-03-15 12:48:45] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:48:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2023-03-15 12:48:46] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2023-03-15 12:48:46] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:48:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-03-15 12:48:46] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:48:46] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 0 ms to minimize.
[2023-03-15 12:48:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-03-15 12:48:46] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2023-03-15 12:48:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 909 ms
[2023-03-15 12:48:48] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2023-03-15 12:48:48] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2023-03-15 12:48:48] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-15 12:48:48] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-15 12:48:48] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2023-03-15 12:48:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 815 ms
[2023-03-15 12:48:49] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2023-03-15 12:48:49] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-15 12:48:49] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:49] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 0 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 0 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1470 ms
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2023-03-15 12:48:50] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2023-03-15 12:48:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-03-15 12:48:51] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-15 12:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-15 12:48:52] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:48:52] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2023-03-15 12:48:52] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-15 12:48:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 12:48:52] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:48:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 12:48:53] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 12:48:54] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 12:48:55] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 1 ms to minimize.
[2023-03-15 12:48:55] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2023-03-15 12:48:55] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 1 ms to minimize.
[2023-03-15 12:48:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 839 ms
[2023-03-15 12:48:57] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 12:48:58] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 12:48:58] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-15 12:48:58] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 0 ms to minimize.
[2023-03-15 12:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 12:48:59] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:48:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 12:48:59] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 1 ms to minimize.
[2023-03-15 12:48:59] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2023-03-15 12:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 748 ms
[2023-03-15 12:49:00] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 0 ms to minimize.
[2023-03-15 12:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-15 12:49:00] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-15 12:49:01] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 12:49:01] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-15 12:49:01] [INFO ] After 40630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :94
Attempting to minimize the solution found.
Minimization took 4735 ms.
[2023-03-15 12:49:06] [INFO ] After 46117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :94
Interrupted random walk after 645775 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties 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 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 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 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 70 ms. (steps per millisecond=142 ) properties (out of 203) 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 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 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 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 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 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 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 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 73 ms. (steps per millisecond=137 ) properties (out of 203) 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 203) 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 203) 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 203) 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 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 70 ms. (steps per millisecond=142 ) properties (out of 203) 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 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 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 73 ms. (steps per millisecond=137 ) 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 70 ms. (steps per millisecond=142 ) 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 71 ms. (steps per millisecond=140 ) properties (out of 203) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 202) 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 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 70 ms. (steps per millisecond=142 ) properties (out of 202) 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 202) 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 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 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 68 ms. (steps per millisecond=147 ) 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 :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 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 70 ms. (steps per millisecond=142 ) properties (out of 202) 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 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 68 ms. (steps per millisecond=147 ) properties (out of 202) 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 202) 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 202) 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 202) 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 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 70 ms. (steps per millisecond=142 ) properties (out of 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 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 70 ms. (steps per millisecond=142 ) properties (out of 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 202) seen :0
Interrupted probabilistic random walk after 9576399 steps, run timeout after 105001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 9576399 steps, saw 1369005 distinct states, run finished after 105003 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 202 properties.
[2023-03-15 12:51:27] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:51:27] [INFO ] Invariant cache hit.
[2023-03-15 12:51:28] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 12:51:36] [INFO ] After 6274ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21 real:181
[2023-03-15 12:51:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:51:37] [INFO ] After 867ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:202
[2023-03-15 12:51:37] [INFO ] After 10696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:202
[2023-03-15 12:51:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 12:51:46] [INFO ] After 5821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :202
[2023-03-15 12:51:53] [INFO ] After 6506ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :202
[2023-03-15 12:51:53] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-15 12:51:54] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2023-03-15 12:51:54] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 1 ms to minimize.
[2023-03-15 12:51:54] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-15 12:51:54] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-15 12:51:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1310 ms
[2023-03-15 12:51:55] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 0 ms to minimize.
[2023-03-15 12:51:55] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-15 12:51:55] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-15 12:51:55] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2023-03-15 12:51:56] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:51:56] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2023-03-15 12:51:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1442 ms
[2023-03-15 12:51:56] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 0 ms to minimize.
[2023-03-15 12:51:57] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2023-03-15 12:51:57] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2023-03-15 12:51:57] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 1 ms to minimize.
[2023-03-15 12:51:57] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:51:58] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 1 ms to minimize.
[2023-03-15 12:51:58] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2023-03-15 12:51:58] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2023-03-15 12:51:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2221 ms
[2023-03-15 12:51:59] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 0 ms to minimize.
[2023-03-15 12:51:59] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-15 12:51:59] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2023-03-15 12:51:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 799 ms
[2023-03-15 12:51:59] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-15 12:52:00] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-15 12:52:00] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:52:00] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:52:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 790 ms
[2023-03-15 12:52:00] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-15 12:52:01] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2023-03-15 12:52:01] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:52:01] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:52:01] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:52:01] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 1 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 0 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 1 ms to minimize.
[2023-03-15 12:52:02] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2381 ms
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-03-15 12:52:03] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-15 12:52:04] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 0 ms to minimize.
[2023-03-15 12:52:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1063 ms
[2023-03-15 12:52:04] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-15 12:52:04] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:52:04] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2023-03-15 12:52:05] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2023-03-15 12:52:05] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:52:05] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:52:05] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-15 12:52:05] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-15 12:52:06] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:52:06] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2023-03-15 12:52:06] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2023-03-15 12:52:07] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 0 ms to minimize.
[2023-03-15 12:52:07] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 1 ms to minimize.
[2023-03-15 12:52:07] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2023-03-15 12:52:07] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 0 ms to minimize.
[2023-03-15 12:52:08] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 0 ms to minimize.
[2023-03-15 12:52:08] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 1 ms to minimize.
[2023-03-15 12:52:08] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-15 12:52:08] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 0 ms to minimize.
[2023-03-15 12:52:09] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2023-03-15 12:52:09] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:52:09] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2023-03-15 12:52:10] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 0 ms to minimize.
[2023-03-15 12:52:10] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2023-03-15 12:52:10] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:52:10] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 0 ms to minimize.
[2023-03-15 12:52:10] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7036 ms
[2023-03-15 12:52:11] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 0 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-15 12:52:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:52:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2023-03-15 12:52:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2023-03-15 12:52:12] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:52:13] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:52:13] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2023-03-15 12:52:13] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2023-03-15 12:52:13] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:52:13] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:52:14] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-15 12:52:14] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 1 ms to minimize.
[2023-03-15 12:52:14] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:52:14] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2023-03-15 12:52:15] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-15 12:52:15] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 0 ms to minimize.
[2023-03-15 12:52:15] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:52:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2644 ms
[2023-03-15 12:52:15] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:52:15] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-15 12:52:16] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 1 ms to minimize.
[2023-03-15 12:52:16] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-15 12:52:16] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:52:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1214 ms
[2023-03-15 12:52:17] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 1 ms to minimize.
[2023-03-15 12:52:17] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:52:17] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-15 12:52:18] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-15 12:52:18] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2023-03-15 12:52:18] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-15 12:52:18] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:52:19] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2023-03-15 12:52:19] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 0 ms to minimize.
[2023-03-15 12:52:19] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2023-03-15 12:52:19] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-15 12:52:20] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-15 12:52:20] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 1 ms to minimize.
[2023-03-15 12:52:20] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:52:20] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 1 ms to minimize.
[2023-03-15 12:52:20] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:52:21] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 12:52:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4381 ms
[2023-03-15 12:52:21] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:52:21] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2023-03-15 12:52:21] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2023-03-15 12:52:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 585 ms
[2023-03-15 12:52:21] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2023-03-15 12:52:22] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2023-03-15 12:52:22] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2023-03-15 12:52:22] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-15 12:52:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 577 ms
[2023-03-15 12:52:23] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2023-03-15 12:52:23] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-15 12:52:23] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 1 ms to minimize.
[2023-03-15 12:52:23] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-15 12:52:23] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 0 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 0 ms to minimize.
[2023-03-15 12:52:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2083 ms
[2023-03-15 12:52:25] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 12:52:25] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-15 12:52:25] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-15 12:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-15 12:52:25] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-15 12:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 12:52:26] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 0 ms to minimize.
[2023-03-15 12:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-15 12:52:27] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2023-03-15 12:52:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 12:52:27] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 0 ms to minimize.
[2023-03-15 12:52:27] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2023-03-15 12:52:27] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 0 ms to minimize.
[2023-03-15 12:52:28] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-15 12:52:28] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:52:28] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-03-15 12:52:28] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 0 ms to minimize.
[2023-03-15 12:52:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1491 ms
[2023-03-15 12:52:28] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2023-03-15 12:52:29] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2023-03-15 12:52:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-15 12:52:29] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-15 12:52:29] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:52:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-15 12:52:30] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-15 12:52:30] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2023-03-15 12:52:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-15 12:52:30] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:52:31] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 0 ms to minimize.
[2023-03-15 12:52:31] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2023-03-15 12:52:31] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:52:31] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:52:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1155 ms
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-15 12:52:32] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2023-03-15 12:52:33] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:52:33] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-15 12:52:33] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-15 12:52:33] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:52:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2135 ms
[2023-03-15 12:52:34] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2023-03-15 12:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 12:52:34] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2023-03-15 12:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 12:52:35] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-15 12:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-15 12:52:35] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-15 12:52:35] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-15 12:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-15 12:52:36] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 0 ms to minimize.
[2023-03-15 12:52:36] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:52:36] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:52:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-03-15 12:52:37] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2023-03-15 12:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-15 12:52:38] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 0 ms to minimize.
[2023-03-15 12:52:38] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-15 12:52:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2023-03-15 12:52:38] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2023-03-15 12:52:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-15 12:52:39] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 12:52:39] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 0 ms to minimize.
[2023-03-15 12:52:39] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 0 ms to minimize.
[2023-03-15 12:52:39] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-15 12:52:40] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2023-03-15 12:52:40] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 0 ms to minimize.
[2023-03-15 12:52:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1006 ms
[2023-03-15 12:52:40] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 1 ms to minimize.
[2023-03-15 12:52:40] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-15 12:52:40] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2023-03-15 12:52:41] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2023-03-15 12:52:41] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 0 ms to minimize.
[2023-03-15 12:52:41] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2023-03-15 12:52:41] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 0 ms to minimize.
[2023-03-15 12:52:42] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 7 ms to minimize.
[2023-03-15 12:52:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1712 ms
[2023-03-15 12:52:43] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-15 12:52:44] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 12:52:44] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 12:52:45] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:52:45] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:52:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2023-03-15 12:52:46] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 0 ms to minimize.
[2023-03-15 12:52:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-15 12:52:46] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2023-03-15 12:52:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 12:52:46] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 1 ms to minimize.
[2023-03-15 12:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 12:52:47] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-15 12:52:49] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2023-03-15 12:52:50] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-15 12:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-03-15 12:52:50] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-15 12:52:50] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2023-03-15 12:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-15 12:52:51] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:52:51] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2023-03-15 12:52:51] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 0 ms to minimize.
[2023-03-15 12:52:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-03-15 12:52:53] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-15 12:52:53] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-03-15 12:52:53] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2023-03-15 12:52:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 344 ms
[2023-03-15 12:52:54] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:52:54] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:52:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2023-03-15 12:52:54] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2023-03-15 12:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-15 12:52:55] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 12:52:55] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-15 12:52:55] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2023-03-15 12:52:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2023-03-15 12:52:56] [INFO ] After 69308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :202
Attempting to minimize the solution found.
Minimization took 11214 ms.
[2023-03-15 12:53:07] [INFO ] After 89748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :202
Fused 202 Parikh solutions to 199 different solutions.
Parikh walk visited 0 properties in 1780 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 20 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.
Interrupted random walk after 666319 steps, including 1 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 71 ms. (steps per millisecond=140 ) properties (out of 202) 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 202) 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 202) 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 202) 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 202) 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 202) 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 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 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 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 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 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 68 ms. (steps per millisecond=147 ) properties (out of 202) 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 202) 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 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 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 68 ms. (steps per millisecond=147 ) properties (out of 202) 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 202) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 200) 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 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 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 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 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 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 70 ms. (steps per millisecond=142 ) 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 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 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 70 ms. (steps per millisecond=142 ) 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 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 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 70 ms. (steps per millisecond=142 ) 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 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 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 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 70 ms. (steps per millisecond=142 ) 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 70 ms. (steps per millisecond=142 ) 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 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 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 70 ms. (steps per millisecond=142 ) 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 70 ms. (steps per millisecond=142 ) 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 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 64 ms. (steps per millisecond=156 ) 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 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 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 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 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 70 ms. (steps per millisecond=142 ) 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 :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 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 :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 67 ms. (steps per millisecond=149 ) properties (out of 199) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 103413 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 199 properties.
[2023-03-15 12:55:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:55:28] [INFO ] Invariant cache hit.
[2023-03-15 12:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 12:55:37] [INFO ] After 6477ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15 real:184
[2023-03-15 12:55:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:55:38] [INFO ] After 633ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:199
[2023-03-15 12:55:38] [INFO ] After 10504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:199
[2023-03-15 12:55:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 12:55:47] [INFO ] After 5845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :199
[2023-03-15 12:55:54] [INFO ] After 6372ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :199
[2023-03-15 12:55:54] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-15 12:55:54] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2023-03-15 12:55:55] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 1 ms to minimize.
[2023-03-15 12:55:55] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:55:55] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2023-03-15 12:55:56] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-15 12:55:56] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 1 ms to minimize.
[2023-03-15 12:55:56] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-15 12:55:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2307 ms
[2023-03-15 12:55:57] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 0 ms to minimize.
[2023-03-15 12:55:57] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:55:57] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:55:57] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:55:58] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2023-03-15 12:55:58] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 1 ms to minimize.
[2023-03-15 12:55:58] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-15 12:55:58] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 1 ms to minimize.
[2023-03-15 12:55:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1977 ms
[2023-03-15 12:55:59] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-15 12:55:59] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 0 ms to minimize.
[2023-03-15 12:55:59] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-15 12:56:00] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2023-03-15 12:56:00] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-15 12:56:00] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 1 ms to minimize.
[2023-03-15 12:56:00] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 1 ms to minimize.
[2023-03-15 12:56:01] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-15 12:56:01] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-15 12:56:01] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 1 ms to minimize.
[2023-03-15 12:56:01] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 0 ms to minimize.
[2023-03-15 12:56:02] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 1 ms to minimize.
[2023-03-15 12:56:02] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2023-03-15 12:56:02] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2023-03-15 12:56:02] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2023-03-15 12:56:03] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2023-03-15 12:56:03] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 1 ms to minimize.
[2023-03-15 12:56:03] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2023-03-15 12:56:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4905 ms
[2023-03-15 12:56:04] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2023-03-15 12:56:04] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 1 ms to minimize.
[2023-03-15 12:56:04] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-15 12:56:04] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 0 ms to minimize.
[2023-03-15 12:56:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 988 ms
[2023-03-15 12:56:05] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-15 12:56:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 12:56:05] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2023-03-15 12:56:05] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:56:05] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1256 ms
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2023-03-15 12:56:06] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:56:07] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:56:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 733 ms
[2023-03-15 12:56:07] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 0 ms to minimize.
[2023-03-15 12:56:07] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2023-03-15 12:56:08] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-15 12:56:08] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2023-03-15 12:56:08] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 0 ms to minimize.
[2023-03-15 12:56:08] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2023-03-15 12:56:09] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 1 ms to minimize.
[2023-03-15 12:56:09] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2023-03-15 12:56:09] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:56:09] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:56:09] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:56:10] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:56:11] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 1 ms to minimize.
[2023-03-15 12:56:11] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-15 12:56:11] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 12:56:11] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 0 ms to minimize.
[2023-03-15 12:56:11] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 1 ms to minimize.
[2023-03-15 12:56:12] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-15 12:56:12] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-15 12:56:12] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-15 12:56:13] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:56:13] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 1 ms to minimize.
[2023-03-15 12:56:13] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-15 12:56:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6114 ms
[2023-03-15 12:56:13] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:56:13] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:56:14] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2023-03-15 12:56:14] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-15 12:56:14] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-15 12:56:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1216 ms
[2023-03-15 12:56:14] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 0 ms to minimize.
[2023-03-15 12:56:15] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-15 12:56:15] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:56:15] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-15 12:56:15] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:56:15] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2023-03-15 12:56:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2024 ms
[2023-03-15 12:56:17] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-15 12:56:17] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-15 12:56:17] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2023-03-15 12:56:17] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:56:18] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:56:18] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:56:18] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:56:18] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2023-03-15 12:56:18] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:56:19] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:56:19] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-15 12:56:19] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:56:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2771 ms
[2023-03-15 12:56:19] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:56:20] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:56:20] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-15 12:56:20] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-15 12:56:20] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-15 12:56:20] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:56:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2210 ms
[2023-03-15 12:56:22] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2023-03-15 12:56:22] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:56:22] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-03-15 12:56:22] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 0 ms to minimize.
[2023-03-15 12:56:22] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2023-03-15 12:56:23] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:56:23] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 0 ms to minimize.
[2023-03-15 12:56:23] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-15 12:56:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1513 ms
[2023-03-15 12:56:23] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 1 ms to minimize.
[2023-03-15 12:56:23] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2023-03-15 12:56:24] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-15 12:56:24] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 1 ms to minimize.
[2023-03-15 12:56:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1198 ms
[2023-03-15 12:56:24] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:56:24] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:56:25] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2023-03-15 12:56:25] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:56:25] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:56:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 800 ms
[2023-03-15 12:56:25] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 1 ms to minimize.
[2023-03-15 12:56:25] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2023-03-15 12:56:26] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 0 ms to minimize.
[2023-03-15 12:56:26] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 0 ms to minimize.
[2023-03-15 12:56:26] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:56:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1243 ms
[2023-03-15 12:56:26] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:56:27] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2023-03-15 12:56:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2023-03-15 12:56:27] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2023-03-15 12:56:27] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:56:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2023-03-15 12:56:28] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-15 12:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 12:56:28] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2023-03-15 12:56:28] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2023-03-15 12:56:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2023-03-15 12:56:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 0 ms to minimize.
[2023-03-15 12:56:30] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2023-03-15 12:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-15 12:56:30] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2023-03-15 12:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 12:56:30] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 12:56:31] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 1 ms to minimize.
[2023-03-15 12:56:31] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 0 ms to minimize.
[2023-03-15 12:56:32] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-15 12:56:32] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:56:32] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2023-03-15 12:56:32] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 1 ms to minimize.
[2023-03-15 12:56:33] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2023-03-15 12:56:33] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 0 ms to minimize.
[2023-03-15 12:56:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2042 ms
[2023-03-15 12:56:33] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-15 12:56:34] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 0 ms to minimize.
[2023-03-15 12:56:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2023-03-15 12:56:34] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-03-15 12:56:34] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:56:34] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2023-03-15 12:56:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 707 ms
[2023-03-15 12:56:35] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2023-03-15 12:56:35] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2023-03-15 12:56:35] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2023-03-15 12:56:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 543 ms
[2023-03-15 12:56:36] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-15 12:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-15 12:56:37] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2023-03-15 12:56:37] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:56:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2023-03-15 12:56:37] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-15 12:56:37] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-15 12:56:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2023-03-15 12:56:39] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 1 ms to minimize.
[2023-03-15 12:56:39] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 0 ms to minimize.
[2023-03-15 12:56:39] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:56:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 642 ms
[2023-03-15 12:56:40] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 12:56:40] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:56:41] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:56:41] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2023-03-15 12:56:41] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-15 12:56:41] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2023-03-15 12:56:41] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:56:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1407 ms
[2023-03-15 12:56:44] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:56:44] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-15 12:56:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-03-15 12:56:45] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2023-03-15 12:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 12:56:46] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 1 ms to minimize.
[2023-03-15 12:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 12:56:46] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 1 ms to minimize.
[2023-03-15 12:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 12:56:48] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 1 ms to minimize.
[2023-03-15 12:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-15 12:56:49] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-15 12:56:49] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 4 ms to minimize.
[2023-03-15 12:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 12:56:50] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2023-03-15 12:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 12:56:50] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-15 12:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 12:56:51] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 0 ms to minimize.
[2023-03-15 12:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 12:56:51] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 0 ms to minimize.
[2023-03-15 12:56:52] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-15 12:56:54] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 1 ms to minimize.
[2023-03-15 12:56:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 12:56:55] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2023-03-15 12:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 12:56:55] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-15 12:56:55] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 0 ms to minimize.
[2023-03-15 12:56:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2023-03-15 12:56:55] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2023-03-15 12:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 12:56:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-15 12:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-15 12:56:57] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 0 ms to minimize.
[2023-03-15 12:56:58] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2023-03-15 12:56:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-15 12:56:59] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:56:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 12:56:59] [INFO ] After 71864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :199
Attempting to minimize the solution found.
Minimization took 15842 ms.
[2023-03-15 12:57:15] [INFO ] After 97035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :199
Parikh walk visited 0 properties in 1365 ms.
Support contains 160 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.
Interrupted random walk after 623422 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 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 72 ms. (steps per millisecond=138 ) properties (out of 199) 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 199) 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 199) 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 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 70 ms. (steps per millisecond=142 ) properties (out of 199) 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 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 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 64 ms. (steps per millisecond=156 ) properties (out of 199) seen :1
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 62 ms. (steps per millisecond=161 ) 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 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 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 62 ms. (steps per millisecond=161 ) properties (out of 198) 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 198) 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 198) 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 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 62 ms. (steps per millisecond=161 ) properties (out of 198) 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 198) 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 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 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 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 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 69 ms. (steps per millisecond=144 ) properties (out of 198) 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 198) 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 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 69 ms. (steps per millisecond=144 ) 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 69 ms. (steps per millisecond=144 ) properties (out of 198) 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 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 73 ms. (steps per millisecond=137 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 198) 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 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 198) 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 198) 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 198) 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 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 69 ms. (steps per millisecond=144 ) 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 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 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
Interrupted probabilistic random walk after 9729349 steps, run timeout after 102001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 9729349 steps, saw 1390866 distinct states, run finished after 102003 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 198 properties.
[2023-03-15 12:59:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 12:59:33] [INFO ] Invariant cache hit.
[2023-03-15 12:59:34] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 12:59:40] [INFO ] After 4130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :25 real:173
[2023-03-15 12:59:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 12:59:40] [INFO ] After 653ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:198
[2023-03-15 12:59:40] [INFO ] After 7417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:198
[2023-03-15 12:59:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 12:59:48] [INFO ] After 4983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :198
[2023-03-15 12:59:53] [INFO ] After 5668ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :198
[2023-03-15 12:59:53] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-15 12:59:54] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-15 12:59:54] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2023-03-15 12:59:54] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-15 12:59:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 782 ms
[2023-03-15 12:59:54] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2023-03-15 12:59:54] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:59:55] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1331 ms
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2023-03-15 12:59:56] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1214 ms
[2023-03-15 12:59:57] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-15 12:59:57] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-15 12:59:57] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2023-03-15 12:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2023-03-15 12:59:58] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1787 ms
[2023-03-15 12:59:59] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-15 12:59:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-15 13:00:00] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:00:00] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:00:00] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2023-03-15 13:00:00] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:00:00] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:00:01] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2389 ms
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:00:02] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:00:03] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:00:04] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:00:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1802 ms
[2023-03-15 13:00:04] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:00:04] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:00:05] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:00:05] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 0 ms to minimize.
[2023-03-15 13:00:05] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:00:05] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:00:05] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:00:06] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3153 ms
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:00:07] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:00:08] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2023-03-15 13:00:08] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:00:08] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2023-03-15 13:00:08] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 0 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:00:09] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2810 ms
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:00:10] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:00:11] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:00:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 616 ms
[2023-03-15 13:00:11] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-15 13:00:11] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:00:11] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:00:12] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-15 13:00:12] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2023-03-15 13:00:12] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2023-03-15 13:00:12] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:00:12] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:00:13] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:00:14] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:00:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2774 ms
[2023-03-15 13:00:14] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2023-03-15 13:00:14] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:00:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-15 13:00:14] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 13:00:15] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:00:15] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-15 13:00:15] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:00:15] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:00:15] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:00:16] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 1 ms to minimize.
[2023-03-15 13:00:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1104 ms
[2023-03-15 13:00:16] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:00:16] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:00:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2023-03-15 13:00:17] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:00:17] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:00:17] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:00:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
[2023-03-15 13:00:18] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2023-03-15 13:00:18] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:00:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2023-03-15 13:00:18] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:00:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
[2023-03-15 13:00:19] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2023-03-15 13:00:19] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2023-03-15 13:00:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-03-15 13:00:19] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:00:19] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:00:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-15 13:00:20] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-03-15 13:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-15 13:00:20] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 13:00:20] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-15 13:00:21] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-15 13:00:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-15 13:00:21] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:00:21] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:00:21] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:00:21] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-15 13:00:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 658 ms
[2023-03-15 13:00:22] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-15 13:00:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-15 13:00:22] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:00:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 13:00:22] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-15 13:00:23] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2023-03-15 13:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:00:23] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 0 ms to minimize.
[2023-03-15 13:00:23] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 0 ms to minimize.
[2023-03-15 13:00:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2023-03-15 13:00:24] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:00:24] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:00:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-15 13:00:25] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-15 13:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-15 13:00:25] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2023-03-15 13:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 13:00:26] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-15 13:00:26] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-15 13:00:27] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 13:00:27] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-15 13:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-15 13:00:28] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-15 13:00:28] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 0 ms to minimize.
[2023-03-15 13:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-15 13:00:29] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 13:00:29] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:00:29] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-15 13:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 940 ms
[2023-03-15 13:00:30] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:00:30] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2023-03-15 13:00:31] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:00:31] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:00:31] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:00:31] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:00:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 666 ms
[2023-03-15 13:00:32] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 13:00:34] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 13:00:34] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-15 13:00:35] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2023-03-15 13:00:35] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-15 13:00:36] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-15 13:00:36] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:00:36] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:00:36] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:00:37] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:00:38] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:00:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1714 ms
[2023-03-15 13:00:38] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:00:38] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:00:38] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:00:38] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:00:39] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:00:39] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:00:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1083 ms
[2023-03-15 13:00:41] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 13:00:41] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 13:00:42] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 1 ms to minimize.
[2023-03-15 13:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 13:00:42] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:00:42] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:00:42] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:00:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 571 ms
[2023-03-15 13:00:43] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 0 ms to minimize.
[2023-03-15 13:00:43] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:00:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-15 13:00:45] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 13:00:45] [INFO ] After 57641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :198
Attempting to minimize the solution found.
Minimization took 13377 ms.
[2023-03-15 13:00:59] [INFO ] After 78349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :198
Parikh walk visited 1 properties in 3250 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 17 ms. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 665372 steps, including 1 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 72 ms. (steps per millisecond=138 ) 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 72 ms. (steps per millisecond=138 ) 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 70 ms. (steps per millisecond=142 ) properties (out of 197) seen :0
Interrupted probabilistic random walk after 8655955 steps, run timeout after 99001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 8655955 steps, saw 1237602 distinct states, run finished after 99001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 197 properties.
[2023-03-15 13:03:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:03:14] [INFO ] Invariant cache hit.
[2023-03-15 13:03:16] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:03:24] [INFO ] After 6308ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:178
[2023-03-15 13:03:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:03:25] [INFO ] After 788ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:197
[2023-03-15 13:03:25] [INFO ] After 10611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:197
[2023-03-15 13:03:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:03:34] [INFO ] After 5755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :197
[2023-03-15 13:03:40] [INFO ] After 6281ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :197
[2023-03-15 13:03:41] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:03:41] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 0 ms to minimize.
[2023-03-15 13:03:41] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 1 ms to minimize.
[2023-03-15 13:03:42] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-15 13:03:42] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:03:42] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:03:42] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:03:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1897 ms
[2023-03-15 13:03:43] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:03:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 13:03:43] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2023-03-15 13:03:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 13:03:43] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:03:44] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:03:44] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:03:44] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:03:44] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 1 ms to minimize.
[2023-03-15 13:03:45] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:03:45] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:03:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1721 ms
[2023-03-15 13:03:45] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-15 13:03:45] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 0 ms to minimize.
[2023-03-15 13:03:45] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:03:46] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-15 13:03:46] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:03:46] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:03:46] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-15 13:03:46] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:03:47] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:03:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1866 ms
[2023-03-15 13:03:47] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2023-03-15 13:03:47] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:03:47] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 1 ms to minimize.
[2023-03-15 13:03:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 750 ms
[2023-03-15 13:03:48] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 0 ms to minimize.
[2023-03-15 13:03:48] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2023-03-15 13:03:48] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-15 13:03:49] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:03:49] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2023-03-15 13:03:49] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 0 ms to minimize.
[2023-03-15 13:03:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1391 ms
[2023-03-15 13:03:49] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:03:49] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2023-03-15 13:03:50] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:03:50] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:03:50] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:03:51] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 0 ms to minimize.
[2023-03-15 13:03:51] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:03:51] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:03:51] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:03:52] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 0 ms to minimize.
[2023-03-15 13:03:52] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 1 ms to minimize.
[2023-03-15 13:03:52] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:03:52] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:03:53] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:03:53] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 1 ms to minimize.
[2023-03-15 13:03:53] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 1 ms to minimize.
[2023-03-15 13:03:53] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:03:54] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:03:54] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2023-03-15 13:03:54] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:03:54] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:03:55] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2023-03-15 13:03:55] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:03:55] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 1 ms to minimize.
[2023-03-15 13:03:55] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5960 ms
[2023-03-15 13:03:55] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:03:56] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:03:56] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2023-03-15 13:03:56] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 1 ms to minimize.
[2023-03-15 13:03:57] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:03:57] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-15 13:03:57] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:03:57] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2023-03-15 13:03:58] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:03:58] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:03:58] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:03:58] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:03:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3212 ms
[2023-03-15 13:03:58] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 0 ms to minimize.
[2023-03-15 13:03:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 13:03:59] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:03:59] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2023-03-15 13:03:59] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:03:59] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 0 ms to minimize.
[2023-03-15 13:04:00] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:04:00] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:04:00] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:04:00] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 0 ms to minimize.
[2023-03-15 13:04:01] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:04:01] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:04:01] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:04:01] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:04:01] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:04:02] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:04:02] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 0 ms to minimize.
[2023-03-15 13:04:02] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:04:02] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 0 ms to minimize.
[2023-03-15 13:04:02] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-15 13:04:03] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-15 13:04:03] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:04:03] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 0 ms to minimize.
[2023-03-15 13:04:03] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:04:04] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:04:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5095 ms
[2023-03-15 13:04:04] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:04:04] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-15 13:04:05] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:04:05] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:04:05] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:04:05] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2023-03-15 13:04:06] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:04:06] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 0 ms to minimize.
[2023-03-15 13:04:06] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-15 13:04:06] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:04:07] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:04:07] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:04:07] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:04:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3205 ms
[2023-03-15 13:04:07] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:04:07] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:04:08] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:04:08] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:04:08] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:04:09] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:04:09] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 1 ms to minimize.
[2023-03-15 13:04:09] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2023-03-15 13:04:09] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 1 ms to minimize.
[2023-03-15 13:04:09] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2023-03-15 13:04:10] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2023-03-15 13:04:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2541 ms
[2023-03-15 13:04:10] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-15 13:04:10] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:04:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-15 13:04:10] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 13:04:11] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:04:11] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:04:11] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 0 ms to minimize.
[2023-03-15 13:04:11] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2023-03-15 13:04:12] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 0 ms to minimize.
[2023-03-15 13:04:12] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 0 ms to minimize.
[2023-03-15 13:04:12] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 0 ms to minimize.
[2023-03-15 13:04:12] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 0 ms to minimize.
[2023-03-15 13:04:13] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:04:13] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2023-03-15 13:04:13] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:04:13] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3464 ms
[2023-03-15 13:04:14] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2023-03-15 13:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2023-03-15 13:04:15] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 0 ms to minimize.
[2023-03-15 13:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-15 13:04:15] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 13:04:16] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-03-15 13:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-15 13:04:16] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:04:16] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2023-03-15 13:04:17] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:04:17] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-15 13:04:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1158 ms
[2023-03-15 13:04:18] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:04:18] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 0 ms to minimize.
[2023-03-15 13:04:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 516 ms
[2023-03-15 13:04:18] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2023-03-15 13:04:19] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2023-03-15 13:04:19] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:04:19] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:04:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 683 ms
[2023-03-15 13:04:19] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2023-03-15 13:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-15 13:04:20] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 13:04:20] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-15 13:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 13:04:20] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 13:04:21] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2023-03-15 13:04:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-15 13:04:21] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:04:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-15 13:04:22] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 1 ms to minimize.
[2023-03-15 13:04:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-15 13:04:22] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:04:22] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2023-03-15 13:04:23] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:04:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 871 ms
[2023-03-15 13:04:24] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 13:04:24] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:04:24] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2023-03-15 13:04:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 831 ms
[2023-03-15 13:04:25] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-15 13:04:26] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2023-03-15 13:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-15 13:04:27] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:04:27] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-15 13:04:27] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2023-03-15 13:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-15 13:04:28] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-15 13:04:30] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 13:04:31] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-15 13:04:31] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2023-03-15 13:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 575 ms
[2023-03-15 13:04:32] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2023-03-15 13:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-15 13:04:32] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 13:04:33] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2023-03-15 13:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 13:04:33] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:04:33] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:04:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
[2023-03-15 13:04:34] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2023-03-15 13:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-15 13:04:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-15 13:04:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-15 13:04:37] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 13:04:37] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:04:37] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 1 ms to minimize.
[2023-03-15 13:04:37] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-15 13:04:38] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:04:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 982 ms
[2023-03-15 13:04:38] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:04:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-15 13:04:39] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2023-03-15 13:04:39] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-03-15 13:04:39] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:04:39] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:04:39] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-15 13:04:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 764 ms
[2023-03-15 13:04:40] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2023-03-15 13:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 13:04:40] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2023-03-15 13:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 13:04:41] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2023-03-15 13:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 13:04:41] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2023-03-15 13:04:41] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 0 ms to minimize.
[2023-03-15 13:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-15 13:04:43] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 13:04:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-15 13:04:44] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-15 13:04:45] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 0 ms to minimize.
[2023-03-15 13:04:45] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:04:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 798 ms
[2023-03-15 13:04:46] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-15 13:04:47] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 1 ms to minimize.
[2023-03-15 13:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-15 13:04:48] [INFO ] After 74079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :197
Attempting to minimize the solution found.
Minimization took 15154 ms.
[2023-03-15 13:05:03] [INFO ] After 98503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :197
Fused 197 Parikh solutions to 195 different solutions.
Parikh walk visited 0 properties in 3176 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 13 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-15 13:05:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:05:07] [INFO ] Invariant cache hit.
[2023-03-15 13:05:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-15 13:05:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:05:07] [INFO ] Invariant cache hit.
[2023-03-15 13:05:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:05:07] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-15 13:05:07] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-15 13:05:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:05:07] [INFO ] Invariant cache hit.
[2023-03-15 13:05:08] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1386 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4031 ms. (steps per millisecond=24 ) properties (out of 158) seen :66
Running SMT prover for 92 properties.
[2023-03-15 13:05:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:05:12] [INFO ] Invariant cache hit.
[2023-03-15 13:05:12] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:05:13] [INFO ] After 424ms SMT Verify possible using state equation in real domain returned unsat :0 sat :92
[2023-03-15 13:05:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:05:13] [INFO ] After 479ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :92
[2023-03-15 13:05:13] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:05:14] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:05:14] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:05:14] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:05:15] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:05:15] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2023-03-15 13:05:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1691 ms
[2023-03-15 13:05:15] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:05:15] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:05:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2023-03-15 13:05:16] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-15 13:05:16] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-15 13:05:17] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-15 13:05:18] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-15 13:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-15 13:05:18] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2023-03-15 13:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-15 13:05:18] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2023-03-15 13:05:19] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:05:19] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 1 ms to minimize.
[2023-03-15 13:05:19] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 1 ms to minimize.
[2023-03-15 13:05:19] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 1 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 0 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1730 ms
[2023-03-15 13:05:20] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 0 ms to minimize.
[2023-03-15 13:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 1 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:05:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 828 ms
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2023-03-15 13:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:05:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
[2023-03-15 13:05:22] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2023-03-15 13:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-15 13:05:23] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2023-03-15 13:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-15 13:05:23] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2023-03-15 13:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-15 13:05:23] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:05:23] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1244 ms
[2023-03-15 13:05:24] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-15 13:05:25] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:05:25] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 1 ms to minimize.
[2023-03-15 13:05:25] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:05:25] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 0 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:05:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1580 ms
[2023-03-15 13:05:27] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2023-03-15 13:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-15 13:05:27] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2023-03-15 13:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-15 13:05:27] [INFO ] After 14680ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:92
[2023-03-15 13:05:27] [INFO ] After 15352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:92
[2023-03-15 13:05:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:05:28] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :92
[2023-03-15 13:05:28] [INFO ] After 524ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :92
[2023-03-15 13:05:29] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:05:29] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-15 13:05:29] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2023-03-15 13:05:29] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:05:30] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:05:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2996 ms
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:05:32] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1460 ms
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2023-03-15 13:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-15 13:05:33] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 0 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 907 ms
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:05:34] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:05:35] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 0 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 0 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:05:36] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-15 13:05:37] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-15 13:05:38] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 1 ms to minimize.
[2023-03-15 13:05:39] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5241 ms
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2023-03-15 13:05:40] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1081 ms
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-15 13:05:41] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1357 ms
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:05:42] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:05:43] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:05:44] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2023-03-15 13:05:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1669 ms
[2023-03-15 13:05:44] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:05:44] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:05:44] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:05:44] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:05:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 788 ms
[2023-03-15 13:05:46] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-15 13:05:46] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:05:46] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-15 13:05:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 448 ms
[2023-03-15 13:05:46] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-15 13:05:46] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 544 ms
[2023-03-15 13:05:47] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2023-03-15 13:05:47] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 13:05:47] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-15 13:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2023-03-15 13:05:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 774 ms
[2023-03-15 13:05:49] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2023-03-15 13:05:49] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-15 13:05:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-15 13:05:49] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2023-03-15 13:05:49] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2023-03-15 13:05:49] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 0 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1260 ms
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2023-03-15 13:05:50] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:05:51] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-15 13:05:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2228 ms
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2023-03-15 13:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2023-03-15 13:05:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 483 ms
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-15 13:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-15 13:05:53] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-03-15 13:05:54] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2023-03-15 13:05:54] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-15 13:05:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 434 ms
[2023-03-15 13:05:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-15 13:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-15 13:05:54] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2023-03-15 13:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-15 13:05:55] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:05:55] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:05:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2023-03-15 13:05:55] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 13:05:55] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2023-03-15 13:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 0 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-03-15 13:05:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 562 ms
[2023-03-15 13:05:57] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2023-03-15 13:05:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-15 13:05:57] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 0 ms to minimize.
[2023-03-15 13:05:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-15 13:05:58] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-15 13:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-15 13:05:58] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 0 ms to minimize.
[2023-03-15 13:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-15 13:05:58] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2023-03-15 13:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-15 13:05:59] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2023-03-15 13:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-15 13:05:59] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-15 13:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 0 ms to minimize.
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:06:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 667 ms
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2023-03-15 13:06:00] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2023-03-15 13:06:01] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:06:01] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 0 ms to minimize.
[2023-03-15 13:06:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 654 ms
[2023-03-15 13:06:01] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-15 13:06:01] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2023-03-15 13:06:01] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2023-03-15 13:06:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2023-03-15 13:06:02] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2023-03-15 13:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2023-03-15 13:06:02] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-15 13:06:02] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-03-15 13:06:02] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 910 ms
[2023-03-15 13:06:03] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2023-03-15 13:06:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 505 ms
[2023-03-15 13:06:04] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2023-03-15 13:06:04] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2023-03-15 13:06:04] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2023-03-15 13:06:04] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 0 ms to minimize.
[2023-03-15 13:06:04] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2023-03-15 13:06:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 875 ms
[2023-03-15 13:06:05] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2023-03-15 13:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 13:06:05] [INFO ] After 36790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :92
Attempting to minimize the solution found.
Minimization took 3988 ms.
[2023-03-15 13:06:09] [INFO ] After 41396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :92
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 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 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 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
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 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442362 steps, run visited all 1 properties in 1745 ms. (steps per millisecond=253 )
Probabilistic random walk after 442362 steps, saw 65796 distinct states, run finished after 1745 ms. (steps per millisecond=253 ) properties seen :1
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 9218 steps, including 2 resets, run visited all 1 properties in 24 ms. (steps per millisecond=384 )
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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7661 steps, run visited all 1 properties in 31 ms. (steps per millisecond=247 )
Probabilistic random walk after 7661 steps, saw 2336 distinct states, run finished after 32 ms. (steps per millisecond=239 ) 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17777 steps, run visited all 1 properties in 70 ms. (steps per millisecond=253 )
Probabilistic random walk after 17777 steps, saw 4286 distinct states, run finished after 71 ms. (steps per millisecond=250 ) properties seen :1
Finished random walk after 960 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=320 )
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
Finished probabilistic random walk after 442363 steps, run visited all 1 properties in 1551 ms. (steps per millisecond=285 )
Probabilistic random walk after 442363 steps, saw 65797 distinct states, run finished after 1552 ms. (steps per millisecond=285 ) 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 925512 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 925512 steps, saw 135533 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:16] [INFO ] Invariant cache hit.
[2023-03-15 13:06:16] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:06:16] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:16] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:16] [INFO ] After 95ms 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-15 13:06:16] [INFO ] After 442ms 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 46 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 46 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 941927 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 941927 steps, saw 137918 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:19] [INFO ] Invariant cache hit.
[2023-03-15 13:06:19] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:19] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:20] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06: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-15 13:06:20] [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 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 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 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:06:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:20] [INFO ] Invariant cache hit.
[2023-03-15 13:06:20] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-15 13:06:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:20] [INFO ] Invariant cache hit.
[2023-03-15 13:06:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:21] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2023-03-15 13:06:21] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:06:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:21] [INFO ] Invariant cache hit.
[2023-03-15 13:06:22] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2290 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 11 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 44 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-15 13:06:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:06:22] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:06:22] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06: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 3 ms.
[2023-03-15 13:06:22] [INFO ] After 35ms 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 )
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
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 981330 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 981330 steps, saw 143138 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:06:25] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:06:25] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:06:25] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:26] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:26] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 13:06:26] [INFO ] After 450ms 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 23 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 24 ms. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 894992 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 894992 steps, saw 131181 distinct states, run finished after 3005 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:29] [INFO ] Invariant cache hit.
[2023-03-15 13:06:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:06:29] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:29] [INFO ] After 54ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:29] [INFO ] After 95ms 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-15 13:06:29] [INFO ] After 471ms 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 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.
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.
[2023-03-15 13:06:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:29] [INFO ] Invariant cache hit.
[2023-03-15 13:06:30] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-15 13:06:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:30] [INFO ] Invariant cache hit.
[2023-03-15 13:06:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:31] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2023-03-15 13:06:31] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-15 13:06:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:31] [INFO ] Invariant cache hit.
[2023-03-15 13:06:32] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2831 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 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-15 13:06:32] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:06:32] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:06:32] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06: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 2 ms.
[2023-03-15 13:06:32] [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 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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17776 steps, run visited all 1 properties in 98 ms. (steps per millisecond=181 )
Probabilistic random walk after 17776 steps, saw 4285 distinct states, run finished after 98 ms. (steps per millisecond=181 ) properties seen :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 870366 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 870366 steps, saw 127570 distinct states, run finished after 3006 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:06:35] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:06:35] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:06:36] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:36] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:36] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 13:06:36] [INFO ] After 485ms 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 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 871038 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 871038 steps, saw 127663 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:39] [INFO ] Invariant cache hit.
[2023-03-15 13:06:39] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:06:39] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:39] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:39] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 13:06:40] [INFO ] After 451ms 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 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:06:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:40] [INFO ] Invariant cache hit.
[2023-03-15 13:06:40] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-15 13:06:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:40] [INFO ] Invariant cache hit.
[2023-03-15 13:06:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:41] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-03-15 13:06:41] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 13:06:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:41] [INFO ] Invariant cache hit.
[2023-03-15 13:06:42] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2392 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-15 13:06:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:06:42] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:06:42] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:42] [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-15 13:06:42] [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 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 978208 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 978208 steps, saw 142855 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:06:45] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:06:45] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:06:45] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:46] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:46] [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 29 ms.
[2023-03-15 13:06:46] [INFO ] After 506ms 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 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 978327 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 978327 steps, saw 142864 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:49] [INFO ] Invariant cache hit.
[2023-03-15 13:06:49] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:49] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:49] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:49] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-15 13:06:49] [INFO ] After 465ms 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 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:06:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:49] [INFO ] Invariant cache hit.
[2023-03-15 13:06:50] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-15 13:06:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:50] [INFO ] Invariant cache hit.
[2023-03-15 13:06:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:51] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
[2023-03-15 13:06:51] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:06:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:51] [INFO ] Invariant cache hit.
[2023-03-15 13:06:51] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2242 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 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-15 13:06:51] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:06:52] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:06:52] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06: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-15 13:06:52] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 5582 steps, including 1 resets, run visited all 1 properties in 19 ms. (steps per millisecond=293 )
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 873278 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 873278 steps, saw 128023 distinct states, run finished after 3003 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:06:55] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:06:55] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:55] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:55] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:55] [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 18 ms.
[2023-03-15 13:06:55] [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 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 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 933632 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 933632 steps, saw 136697 distinct states, run finished after 3002 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:06:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:58] [INFO ] Invariant cache hit.
[2023-03-15 13:06:58] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:06:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:06:58] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:06:59] [INFO ] After 83ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:06:59] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 13:06:59] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:06:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:59] [INFO ] Invariant cache hit.
[2023-03-15 13:06:59] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-15 13:06:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:06:59] [INFO ] Invariant cache hit.
[2023-03-15 13:06:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:00] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-03-15 13:07:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:07:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:00] [INFO ] Invariant cache hit.
[2023-03-15 13:07:01] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2318 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 2 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 1 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-15 13:07:01] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:07:01] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:07:01] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:01] [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-15 13:07:01] [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 899486 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899486 steps, saw 131611 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:04] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 13:07:04] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:07:05] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:05] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:05] [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 23 ms.
[2023-03-15 13:07:05] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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.
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 947828 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947828 steps, saw 138612 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:08] [INFO ] Invariant cache hit.
[2023-03-15 13:07:08] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:07:08] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:08] [INFO ] After 49ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:08] [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 23 ms.
[2023-03-15 13:07:08] [INFO ] After 421ms 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 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:07:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:08] [INFO ] Invariant cache hit.
[2023-03-15 13:07:09] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-15 13:07:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:09] [INFO ] Invariant cache hit.
[2023-03-15 13:07:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:10] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2023-03-15 13:07:10] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:07:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:10] [INFO ] Invariant cache hit.
[2023-03-15 13:07:11] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2569 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 1 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-15 13:07:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:07:11] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:07:11] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:11] [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-15 13:07:11] [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 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131093 steps, run visited all 1 properties in 542 ms. (steps per millisecond=241 )
Probabilistic random walk after 131093 steps, saw 20848 distinct states, run finished after 543 ms. (steps per millisecond=241 ) properties seen :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 9 ms. (steps per millisecond=1111 ) 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 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 988890 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 988890 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-15 13:07:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:15] [INFO ] Computed 17 place invariants in 9 ms
[2023-03-15 13:07:15] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:07:15] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:15] [INFO ] After 45ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:15] [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-15 13:07:15] [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 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 9 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 903462 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 903462 steps, saw 132145 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:18] [INFO ] Invariant cache hit.
[2023-03-15 13:07:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:07:19] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:19] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:19] [INFO ] After 95ms 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-15 13:07:19] [INFO ] After 483ms 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 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:07:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:19] [INFO ] Invariant cache hit.
[2023-03-15 13:07:19] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-15 13:07:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:19] [INFO ] Invariant cache hit.
[2023-03-15 13:07:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:20] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2023-03-15 13:07:20] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:07:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:20] [INFO ] Invariant cache hit.
[2023-03-15 13:07:21] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2330 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 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-15 13:07:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:07:21] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:07:21] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:21] [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-15 13:07:21] [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 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 933933 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 933933 steps, saw 136740 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:24] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:07:24] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:07:24] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:25] [INFO ] After 41ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:25] [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-15 13:07:25] [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 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 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 923265 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923265 steps, saw 134433 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:28] [INFO ] Invariant cache hit.
[2023-03-15 13:07:28] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:07:28] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:28] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:28] [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 20 ms.
[2023-03-15 13:07:28] [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.
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-15 13:07:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:28] [INFO ] Invariant cache hit.
[2023-03-15 13:07:29] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-15 13:07:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:29] [INFO ] Invariant cache hit.
[2023-03-15 13:07:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:30] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2023-03-15 13:07:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:07:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:30] [INFO ] Invariant cache hit.
[2023-03-15 13:07:30] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2169 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-15 13:07:30] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:07:30] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:07:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:30] [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-15 13:07:30] [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 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished Best-First random walk after 8024 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=891 )
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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982982 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982982 steps, saw 143283 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:33] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 13:07:33] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:07:34] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:34] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:34] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:07:34] [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 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 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 977102 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 977102 steps, saw 142729 distinct states, run finished after 3002 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:37] [INFO ] Invariant cache hit.
[2023-03-15 13:07:37] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:07:38] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:38] [INFO ] After 54ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:38] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:07:38] [INFO ] After 485ms 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 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:07:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:38] [INFO ] Invariant cache hit.
[2023-03-15 13:07:38] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-15 13:07:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:38] [INFO ] Invariant cache hit.
[2023-03-15 13:07:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:39] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2023-03-15 13:07:39] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:07:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:39] [INFO ] Invariant cache hit.
[2023-03-15 13:07:40] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2306 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 1 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-15 13:07:40] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:07:40] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:07:40] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:40] [INFO ] After 29ms 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-15 13:07:40] [INFO ] After 73ms 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 993853 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 993853 steps, saw 144045 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:43] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:07:43] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:07:44] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:44] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:44] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:07:44] [INFO ] After 481ms 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 1024562 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1024562 steps, saw 149375 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:47] [INFO ] Invariant cache hit.
[2023-03-15 13:07:47] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:07:47] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:47] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:47] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 13:07:47] [INFO ] After 407ms 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-15 13:07:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:47] [INFO ] Invariant cache hit.
[2023-03-15 13:07:48] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-15 13:07:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:48] [INFO ] Invariant cache hit.
[2023-03-15 13:07:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:49] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2023-03-15 13:07:49] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:07:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:49] [INFO ] Invariant cache hit.
[2023-03-15 13:07:50] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2901 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 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-15 13:07:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:07:50] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:07:50] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:50] [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-15 13:07:50] [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 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 211559 steps, run visited all 1 properties in 1067 ms. (steps per millisecond=198 )
Probabilistic random walk after 211559 steps, saw 32809 distinct states, run finished after 1067 ms. (steps per millisecond=198 ) 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 911960 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 911960 steps, saw 133375 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:07:54] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:07:54] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:07:55] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:55] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:55] [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 33 ms.
[2023-03-15 13:07:55] [INFO ] After 476ms 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 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 835464 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 835464 steps, saw 122577 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:07:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:58] [INFO ] Invariant cache hit.
[2023-03-15 13:07:58] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:07:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:07:58] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:07:59] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:07:59] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-15 13:07:59] [INFO ] After 572ms 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 14 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 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:07:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:59] [INFO ] Invariant cache hit.
[2023-03-15 13:07:59] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-15 13:07:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:07:59] [INFO ] Invariant cache hit.
[2023-03-15 13:07:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:01] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2023-03-15 13:08:01] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:08:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:01] [INFO ] Invariant cache hit.
[2023-03-15 13:08:01] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2670 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 1 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 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-15 13:08:01] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:01] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:01] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:01] [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-15 13:08:01] [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 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 930475 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930475 steps, saw 136335 distinct states, run finished after 3006 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:04] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:08:05] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:08:05] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:05] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:05] [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 35 ms.
[2023-03-15 13:08:05] [INFO ] After 522ms 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 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 949375 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 949375 steps, saw 138722 distinct states, run finished after 3010 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:08] [INFO ] Invariant cache hit.
[2023-03-15 13:08:08] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:08:09] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:09] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:09] [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 34 ms.
[2023-03-15 13:08:09] [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 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-15 13:08:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:09] [INFO ] Invariant cache hit.
[2023-03-15 13:08:09] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-15 13:08:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:09] [INFO ] Invariant cache hit.
[2023-03-15 13:08:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:11] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-15 13:08:11] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:08:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:11] [INFO ] Invariant cache hit.
[2023-03-15 13:08:11] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 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-15 13:08:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:12] [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-15 13:08:12] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 8175 steps, including 2 resets, run visited all 1 properties in 28 ms. (steps per millisecond=291 )
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 131857 steps, run visited all 1 properties in 558 ms. (steps per millisecond=236 )
Probabilistic random walk after 131857 steps, saw 21305 distinct states, run finished after 562 ms. (steps per millisecond=234 ) 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
Finished Best-First random walk after 1995 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=665 )
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 637 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=637 )
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
Finished probabilistic random walk after 131807 steps, run visited all 1 properties in 392 ms. (steps per millisecond=336 )
Probabilistic random walk after 131807 steps, saw 21266 distinct states, run finished after 393 ms. (steps per millisecond=335 ) properties seen :1
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
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 1016484 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016484 steps, saw 148615 distinct states, run finished after 3004 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:16] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:08:16] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:08:16] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:16] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:16] [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 24 ms.
[2023-03-15 13:08:16] [INFO ] After 379ms 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 963865 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 963865 steps, saw 140995 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:19] [INFO ] Invariant cache hit.
[2023-03-15 13:08:19] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:08:20] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:20] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:20] [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 29 ms.
[2023-03-15 13:08:20] [INFO ] After 451ms 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 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:08:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:20] [INFO ] Invariant cache hit.
[2023-03-15 13:08:20] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-15 13:08:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:20] [INFO ] Invariant cache hit.
[2023-03-15 13:08:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:22] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2023-03-15 13:08:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:08:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:22] [INFO ] Invariant cache hit.
[2023-03-15 13:08:22] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2514 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 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-15 13:08:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:22] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:22] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08: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-15 13:08:22] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
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 950481 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 950481 steps, saw 138815 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:25] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:08:26] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:08:26] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:26] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:26] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:08:26] [INFO ] After 468ms 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 955913 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 955913 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-15 13:08:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:29] [INFO ] Invariant cache hit.
[2023-03-15 13:08:29] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:08:29] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:30] [INFO ] After 55ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:30] [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 30 ms.
[2023-03-15 13:08:30] [INFO ] After 487ms 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.
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-15 13:08:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:30] [INFO ] Invariant cache hit.
[2023-03-15 13:08:30] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-15 13:08:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:30] [INFO ] Invariant cache hit.
[2023-03-15 13:08:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:32] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2023-03-15 13:08:32] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:08:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:32] [INFO ] Invariant cache hit.
[2023-03-15 13:08:32] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2366 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 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 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-15 13:08:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:32] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:32] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:32] [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-15 13:08:32] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
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 1019627 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1019627 steps, saw 148891 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:35] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:08:35] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:08:36] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:36] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:36] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:08:36] [INFO ] After 506ms 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 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 913157 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 913157 steps, saw 133441 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:39] [INFO ] Invariant cache hit.
[2023-03-15 13:08:39] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 13:08:39] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:39] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:39] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 13:08:39] [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 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 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:08:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:39] [INFO ] Invariant cache hit.
[2023-03-15 13:08:40] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-15 13:08:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:40] [INFO ] Invariant cache hit.
[2023-03-15 13:08:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:41] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2023-03-15 13:08:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:08:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:41] [INFO ] Invariant cache hit.
[2023-03-15 13:08:42] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2677 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-15 13:08:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:42] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:42] [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-15 13:08:42] [INFO ] After 41ms 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 820407 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 820407 steps, saw 120658 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:45] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:08:45] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:08:46] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:46] [INFO ] After 84ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:46] [INFO ] After 136ms 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-15 13:08:46] [INFO ] After 749ms 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 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 872872 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 872872 steps, saw 127951 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:49] [INFO ] Invariant cache hit.
[2023-03-15 13:08:49] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:08:49] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:50] [INFO ] After 71ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:50] [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 30 ms.
[2023-03-15 13:08:50] [INFO ] After 555ms 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-15 13:08:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:50] [INFO ] Invariant cache hit.
[2023-03-15 13:08:50] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-15 13:08:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:50] [INFO ] Invariant cache hit.
[2023-03-15 13:08:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:52] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-03-15 13:08:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:08:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:52] [INFO ] Invariant cache hit.
[2023-03-15 13:08:52] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 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 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-15 13:08:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:08:52] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:08:52] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:52] [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-15 13:08:52] [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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 933758 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 933758 steps, saw 136719 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:08:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:08:55] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:08:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:08:56] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:08:56] [INFO ] After 64ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:08:56] [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 30 ms.
[2023-03-15 13:08:56] [INFO ] After 504ms 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 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 915971 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 915971 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-15 13:08:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:08:59] [INFO ] Invariant cache hit.
[2023-03-15 13:08:59] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:08:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:09:00] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:00] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:00] [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-15 13:09:00] [INFO ] After 579ms 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 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:09:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:00] [INFO ] Invariant cache hit.
[2023-03-15 13:09:00] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-15 13:09:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:00] [INFO ] Invariant cache hit.
[2023-03-15 13:09:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:02] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-03-15 13:09:02] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:09:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:02] [INFO ] Invariant cache hit.
[2023-03-15 13:09:02] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 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 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-15 13:09:02] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:09:02] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:09:03] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09: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 2 ms.
[2023-03-15 13:09:03] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
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 909895 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 909895 steps, saw 133135 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:06] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:06] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:09:06] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 13:09:06] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:06] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:06] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 0 ms to minimize.
[2023-03-15 13:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 13:09:06] [INFO ] After 334ms 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-15 13:09:06] [INFO ] After 638ms 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 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.
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 717899 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 717899 steps, saw 105932 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:09] [INFO ] Invariant cache hit.
[2023-03-15 13:09:09] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:09:10] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:10] [INFO ] After 52ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:10] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-15 13:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 13:09:10] [INFO ] After 324ms 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-15 13:09:10] [INFO ] After 690ms 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-15 13:09:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:10] [INFO ] Invariant cache hit.
[2023-03-15 13:09:11] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-15 13:09:11] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:11] [INFO ] Invariant cache hit.
[2023-03-15 13:09:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:12] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2023-03-15 13:09:12] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:09:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:12] [INFO ] Invariant cache hit.
[2023-03-15 13:09:13] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2920 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.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 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-15 13:09:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:09:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:09:13] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:13] [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-15 13:09:13] [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 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 916181 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916181 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-15 13:09:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:16] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:09:16] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:09:17] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:17] [INFO ] After 73ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:17] [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-15 13:09:17] [INFO ] After 458ms 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 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 924280 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 924280 steps, saw 135018 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:20] [INFO ] Invariant cache hit.
[2023-03-15 13:09:20] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:09:20] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:20] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:20] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 13:09:20] [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 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-15 13:09:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:20] [INFO ] Invariant cache hit.
[2023-03-15 13:09:21] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-15 13:09:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:21] [INFO ] Invariant cache hit.
[2023-03-15 13:09:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:22] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-15 13:09:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:09:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:22] [INFO ] Invariant cache hit.
[2023-03-15 13:09:23] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2859 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 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-15 13:09:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:09:23] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:09:23] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:23] [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-15 13:09:23] [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 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 850388 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 850388 steps, saw 123971 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:26] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:09:27] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 13:09:27] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:27] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:27] [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-15 13:09:27] [INFO ] After 540ms 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 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 946477 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946477 steps, saw 138447 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:30] [INFO ] Invariant cache hit.
[2023-03-15 13:09:30] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:09:30] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:31] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:31] [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-15 13:09:31] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 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-15 13:09:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:31] [INFO ] Invariant cache hit.
[2023-03-15 13:09:31] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-15 13:09:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:31] [INFO ] Invariant cache hit.
[2023-03-15 13:09:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:33] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2023-03-15 13:09:33] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:09:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:33] [INFO ] Invariant cache hit.
[2023-03-15 13:09:33] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2840 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 1 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 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-15 13:09:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:09:33] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:09:33] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:33] [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-15 13:09:33] [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 942144 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 942144 steps, saw 137940 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:37] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:09:37] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:09:37] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:37] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:37] [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-15 13:09:37] [INFO ] After 518ms 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 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 899913 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899913 steps, saw 131659 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:40] [INFO ] Invariant cache hit.
[2023-03-15 13:09:40] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:09:41] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:41] [INFO ] After 65ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:41] [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 27 ms.
[2023-03-15 13:09:41] [INFO ] After 501ms 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-15 13:09:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:41] [INFO ] Invariant cache hit.
[2023-03-15 13:09:41] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-15 13:09:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:41] [INFO ] Invariant cache hit.
[2023-03-15 13:09:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:43] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2023-03-15 13:09:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 13:09:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:43] [INFO ] Invariant cache hit.
[2023-03-15 13:09:43] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2406 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-15 13:09:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:09:43] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:09:43] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:43] [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-15 13:09:43] [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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 884891 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 884891 steps, saw 128496 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:46] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:09:46] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:09:47] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:47] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:47] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 13:09:47] [INFO ] After 555ms 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 947499 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947499 steps, saw 138578 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:50] [INFO ] Invariant cache hit.
[2023-03-15 13:09:50] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:09:50] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:51] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:51] [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-15 13:09:51] [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 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-15 13:09:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:51] [INFO ] Invariant cache hit.
[2023-03-15 13:09:51] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-15 13:09:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:51] [INFO ] Invariant cache hit.
[2023-03-15 13:09:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:53] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-15 13:09:53] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 13:09:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:09:53] [INFO ] Invariant cache hit.
[2023-03-15 13:09:54] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2943 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-15 13:09:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:09:54] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:09:54] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09: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 2 ms.
[2023-03-15 13:09:54] [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 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 939813 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 939813 steps, saw 137588 distinct states, run finished after 3004 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:09:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:09:57] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:09:57] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:09:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:09:57] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:09:57] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:09:57] [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-15 13:09:57] [INFO ] After 517ms 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 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 916321 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916321 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-15 13:10:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:00] [INFO ] Invariant cache hit.
[2023-03-15 13:10:00] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 13:10:01] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:01] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:01] [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 28 ms.
[2023-03-15 13:10:01] [INFO ] After 499ms 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 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2023-03-15 13:10:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:01] [INFO ] Invariant cache hit.
[2023-03-15 13:10:01] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-15 13:10:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:01] [INFO ] Invariant cache hit.
[2023-03-15 13:10:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:03] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2023-03-15 13:10:03] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:10:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:03] [INFO ] Invariant cache hit.
[2023-03-15 13:10:04] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2623 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 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-15 13:10:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:10:04] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:10:04] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:04] [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-15 13:10:04] [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 977214 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 977214 steps, saw 142750 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:07] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:10:07] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:10:07] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 13:10:07] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:07] [INFO ] After 66ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:08] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 0 ms to minimize.
[2023-03-15 13:10:08] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-15 13:10:08] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:10:08] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-15 13:10:09] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 0 ms to minimize.
[2023-03-15 13:10:09] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:10:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1572 ms
[2023-03-15 13:10:09] [INFO ] After 1671ms 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-15 13:10:09] [INFO ] After 2130ms 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 14 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 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 940996 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940996 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-15 13:10:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:12] [INFO ] Invariant cache hit.
[2023-03-15 13:10:12] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 13:10:12] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:12] [INFO ] After 48ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:13] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-15 13:10:13] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-15 13:10:13] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-15 13:10:13] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 0 ms to minimize.
[2023-03-15 13:10:14] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:10:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1296 ms
[2023-03-15 13:10:14] [INFO ] After 1370ms 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-15 13:10:14] [INFO ] After 1679ms 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-15 13:10:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:14] [INFO ] Invariant cache hit.
[2023-03-15 13:10:14] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-15 13:10:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:14] [INFO ] Invariant cache hit.
[2023-03-15 13:10:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:16] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-15 13:10:16] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 13:10:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:16] [INFO ] Invariant cache hit.
[2023-03-15 13:10:17] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2893 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 1 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-15 13:10:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:10:17] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 13:10:17] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10: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-15 13:10:17] [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 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 888713 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 888713 steps, saw 130402 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:10:20] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 13:10:20] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:10:20] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:20] [INFO ] After 61ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:20] [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 28 ms.
[2023-03-15 13:10:20] [INFO ] After 519ms 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 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 864563 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 864563 steps, saw 126712 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:23] [INFO ] Invariant cache hit.
[2023-03-15 13:10:24] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:10:24] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:24] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:24] [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 26 ms.
[2023-03-15 13:10:24] [INFO ] After 468ms 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-15 13:10:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:24] [INFO ] Invariant cache hit.
[2023-03-15 13:10:25] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-15 13:10:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:25] [INFO ] Invariant cache hit.
[2023-03-15 13:10:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:26] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2023-03-15 13:10:26] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 13:10:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:26] [INFO ] Invariant cache hit.
[2023-03-15 13:10:27] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2560 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 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-15 13:10:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 13:10:27] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:10:27] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10: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 3 ms.
[2023-03-15 13:10:27] [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 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 907641 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 907641 steps, saw 132781 distinct states, run finished after 3002 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:30] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:10:30] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 13:10:30] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:10:30] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:30] [INFO ] After 53ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:30] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 13:10:30] [INFO ] After 456ms 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 14 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.
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 1023687 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1023687 steps, saw 149285 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:33] [INFO ] Invariant cache hit.
[2023-03-15 13:10:33] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 13:10:34] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:34] [INFO ] After 76ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:34] [INFO ] After 131ms 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-15 13:10:34] [INFO ] After 522ms 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-15 13:10:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:34] [INFO ] Invariant cache hit.
[2023-03-15 13:10:34] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-15 13:10:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:34] [INFO ] Invariant cache hit.
[2023-03-15 13:10:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:36] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2023-03-15 13:10:36] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 13:10:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2023-03-15 13:10:36] [INFO ] Invariant cache hit.
[2023-03-15 13:10:36] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2428 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 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-15 13:10:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 13:10:36] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 13:10:36] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:36] [INFO ] After 11ms 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-15 13:10:36] [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 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 889777 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 889777 steps, saw 130601 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:10:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2023-03-15 13:10:39] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 13:10:40] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:10:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 13:10:40] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 13:10:40] [INFO ] After 57ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:10:40] [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 28 ms.
[2023-03-15 13:10:40] [INFO ] After 516ms 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 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
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15746000 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16125976 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Peterson-PT-5, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r277-smll-167863548900392"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;