Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 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 1717247770111

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:16:12] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-06-01 13:16:12] [INFO ] Transformed 1330 places.
[2024-06-01 13:16:12] [INFO ] Transformed 2030 transitions.
[2024-06-01 13:16:12] [INFO ] Found NUPN structural information;
[2024-06-01 13:16:12] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 502 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 6 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 259 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2024-06-01 13:16:12] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2024-06-01 13:16:12] [INFO ] Computed 27 invariants in 28 ms
[2024-06-01 13:16:14] [INFO ] Implicit Places using invariants in 1284 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1645 ms. Remains : 399/1330 places, 1106/2030 transitions.
Discarding 7 transitions out of 1106. Remains 1099
RANDOM walk for 40000 steps (8 resets) in 4187 ms. (9 steps per ms) remains 433/1099 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 433/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 432/433 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 432/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 36 ms. (10 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 430/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/430 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 429/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/429 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 427/427 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 427/427 properties
[2024-06-01 13:16:15] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2024-06-01 13:16:15] [INFO ] Computed 20 invariants in 7 ms
[2024-06-01 13:16:16] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/1295 variables, and 306 constraints, problems are : Problem set: 0 solved, 427 unsolved in 5042 ms.
Refiners :[Domain max(s): 300/399 constraints, Positive P Invariants (semi-flows): 6/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 99/399 variables, 14/320 constraints. Problems are: Problem set: 0 solved, 427 unsolved
SMT process timed out in 10392ms, After SMT, problems are : Problem set: 0 solved, 427 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 300 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 70 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 113792 ms. (35 steps per ms) remains 407/427 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 406/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 400/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 398/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 396/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 396/396 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 396/396 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 396/396 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 396/396 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/396 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 390/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 389/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 387/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 385/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 382/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 381/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 379/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 377/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 377/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 376/377 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 374/376 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
[2024-06-01 13:17:01] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:17:01] [INFO ] Invariant cache hit.
[2024-06-01 13:17:01] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 126/398 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 126/417 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-01 13:17:12] [INFO ] Deduced a trap composed of 61 places in 400 ms of which 56 ms to minimize.
[2024-06-01 13:17:13] [INFO ] Deduced a trap composed of 23 places in 538 ms of which 7 ms to minimize.
[2024-06-01 13:17:13] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 7 ms to minimize.
[2024-06-01 13:17:14] [INFO ] Deduced a trap composed of 52 places in 501 ms of which 7 ms to minimize.
[2024-06-01 13:17:14] [INFO ] Deduced a trap composed of 74 places in 506 ms of which 6 ms to minimize.
[2024-06-01 13:17:14] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:17:15] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:17:15] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 5 ms to minimize.
[2024-06-01 13:17:15] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:17:16] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:17:16] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:17:16] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:17:17] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 5 ms to minimize.
[2024-06-01 13:17:17] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:17:17] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:17:18] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:17:18] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:17:18] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:17:19] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:17:19] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-01 13:17:20] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 3 ms to minimize.
[2024-06-01 13:17:20] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:17:21] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:17:21] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:17:21] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 5 ms to minimize.
[2024-06-01 13:17:22] [INFO ] Deduced a trap composed of 10 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:17:22] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 5 ms to minimize.
[2024-06-01 13:17:23] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 3 ms to minimize.
[2024-06-01 13:17:23] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:17:23] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:17:23] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:17:24] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:17:24] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 6 ms to minimize.
[2024-06-01 13:17:25] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 6 ms to minimize.
[2024-06-01 13:17:25] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:17:26] [INFO ] Deduced a trap composed of 18 places in 470 ms of which 6 ms to minimize.
[2024-06-01 13:17:26] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:17:26] [INFO ] Deduced a trap composed of 56 places in 431 ms of which 5 ms to minimize.
[2024-06-01 13:17:27] [INFO ] Deduced a trap composed of 50 places in 443 ms of which 6 ms to minimize.
[2024-06-01 13:17:27] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-01 13:17:33] [INFO ] Deduced a trap composed of 15 places in 436 ms of which 6 ms to minimize.
[2024-06-01 13:17:33] [INFO ] Deduced a trap composed of 47 places in 449 ms of which 6 ms to minimize.
[2024-06-01 13:17:34] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:17:34] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 6 ms to minimize.
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 65 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 41 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 5 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 10 places in 452 ms of which 6 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 5 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 66 places in 453 ms of which 6 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 57 places in 473 ms of which 5 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:17:40] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 5 ms to minimize.
[2024-06-01 13:17:40] [INFO ] Deduced a trap composed of 10 places in 422 ms of which 6 ms to minimize.
[2024-06-01 13:17:41] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 6 ms to minimize.
[2024-06-01 13:17:41] [INFO ] Deduced a trap composed of 18 places in 470 ms of which 5 ms to minimize.
[2024-06-01 13:17:42] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 20 places in 514 ms of which 5 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 30 places in 500 ms of which 5 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 20 places in 509 ms of which 5 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 7 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 6 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 5 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 57 places in 406 ms of which 5 ms to minimize.
SMT process timed out in 45279ms, After SMT, problems are : Problem set: 0 solved, 374 unsolved
Fused 374 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 272 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 57 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 103566 ms. (38 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 374/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 371/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 369/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 368/369 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 367/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 363/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 361/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 359/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 359/359 properties
Interrupted probabilistic random walk after 9620320 steps, run timeout after 99001 ms. (steps per millisecond=97 ) properties seen :0 out of 359
Probabilistic random walk after 9620320 steps, saw 1211533 distinct states, run finished after 99013 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-01 13:19:59] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:19:59] [INFO ] Invariant cache hit.
[2024-06-01 13:19:59] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (OVERLAPS) 134/398 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 134/417 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 61 places in 509 ms of which 6 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 6 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 18 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 6 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 6 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 6 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 6 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 28 places in 482 ms of which 6 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 6 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 18 places in 475 ms of which 5 ms to minimize.
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 5 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 5 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Deduced a trap composed of 10 places in 431 ms of which 6 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:20:18] [INFO ] Deduced a trap composed of 40 places in 790 ms of which 5 ms to minimize.
[2024-06-01 13:20:19] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 5 ms to minimize.
[2024-06-01 13:20:19] [INFO ] Deduced a trap composed of 30 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:20:20] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 6 ms to minimize.
[2024-06-01 13:20:20] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:20:21] [INFO ] Deduced a trap composed of 39 places in 503 ms of which 6 ms to minimize.
[2024-06-01 13:20:22] [INFO ] Deduced a trap composed of 26 places in 511 ms of which 6 ms to minimize.
[2024-06-01 13:20:22] [INFO ] Deduced a trap composed of 21 places in 491 ms of which 6 ms to minimize.
[2024-06-01 13:20:23] [INFO ] Deduced a trap composed of 45 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:20:23] [INFO ] Deduced a trap composed of 52 places in 458 ms of which 6 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 38 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 28 places in 462 ms of which 6 ms to minimize.
[2024-06-01 13:20:25] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 6 ms to minimize.
[2024-06-01 13:20:25] [INFO ] Deduced a trap composed of 48 places in 425 ms of which 6 ms to minimize.
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 5 ms to minimize.
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:20:27] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 6 ms to minimize.
[2024-06-01 13:20:27] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 6 ms to minimize.
[2024-06-01 13:20:28] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:20:28] [INFO ] Deduced a trap composed of 76 places in 431 ms of which 6 ms to minimize.
[2024-06-01 13:20:28] [INFO ] Deduced a trap composed of 61 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:20:29] [INFO ] Deduced a trap composed of 58 places in 459 ms of which 6 ms to minimize.
[2024-06-01 13:20:29] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 6 ms to minimize.
[2024-06-01 13:20:30] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:20:35] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:20:36] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:20:36] [INFO ] Deduced a trap composed of 82 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:20:37] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 6 ms to minimize.
[2024-06-01 13:20:37] [INFO ] Deduced a trap composed of 13 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:20:37] [INFO ] Deduced a trap composed of 62 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 81 places in 356 ms of which 6 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:20:39] [INFO ] Deduced a trap composed of 83 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:20:39] [INFO ] Deduced a trap composed of 99 places in 431 ms of which 6 ms to minimize.
[2024-06-01 13:20:40] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:20:40] [INFO ] Deduced a trap composed of 103 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:20:40] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 6 ms to minimize.
[2024-06-01 13:20:41] [INFO ] Deduced a trap composed of 68 places in 462 ms of which 6 ms to minimize.
[2024-06-01 13:20:41] [INFO ] Deduced a trap composed of 40 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:20:42] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:20:42] [INFO ] Deduced a trap composed of 58 places in 444 ms of which 4 ms to minimize.
[2024-06-01 13:20:43] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:20:43] [INFO ] Deduced a trap composed of 10 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:20:44] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:20:45] [INFO ] Deduced a trap composed of 27 places in 444 ms of which 6 ms to minimize.
[2024-06-01 13:20:46] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 5 ms to minimize.
[2024-06-01 13:20:46] [INFO ] Deduced a trap composed of 14 places in 438 ms of which 7 ms to minimize.
[2024-06-01 13:20:46] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 6 ms to minimize.
[2024-06-01 13:20:47] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:20:47] [INFO ] Deduced a trap composed of 48 places in 433 ms of which 6 ms to minimize.
[2024-06-01 13:20:48] [INFO ] Deduced a trap composed of 71 places in 460 ms of which 5 ms to minimize.
[2024-06-01 13:20:48] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 6 ms to minimize.
[2024-06-01 13:20:49] [INFO ] Deduced a trap composed of 10 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:20:49] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 6 ms to minimize.
[2024-06-01 13:20:50] [INFO ] Deduced a trap composed of 14 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:20:50] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:20:51] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 6 ms to minimize.
[2024-06-01 13:20:51] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 5 ms to minimize.
[2024-06-01 13:20:52] [INFO ] Deduced a trap composed of 10 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:20:52] [INFO ] Deduced a trap composed of 25 places in 449 ms of which 6 ms to minimize.
[2024-06-01 13:20:52] [INFO ] Deduced a trap composed of 19 places in 418 ms of which 6 ms to minimize.
[2024-06-01 13:20:53] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 5 ms to minimize.
[2024-06-01 13:20:53] [INFO ] Deduced a trap composed of 12 places in 473 ms of which 5 ms to minimize.
[2024-06-01 13:20:54] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:20:55] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 6 ms to minimize.
[2024-06-01 13:20:56] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:20:56] [INFO ] Deduced a trap composed of 53 places in 436 ms of which 6 ms to minimize.
[2024-06-01 13:20:57] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 6 ms to minimize.
[2024-06-01 13:20:57] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 6 ms to minimize.
[2024-06-01 13:20:57] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 6 ms to minimize.
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 6 ms to minimize.
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 50 places in 420 ms of which 6 ms to minimize.
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 5 ms to minimize.
[2024-06-01 13:21:00] [INFO ] Deduced a trap composed of 20 places in 421 ms of which 6 ms to minimize.
[2024-06-01 13:21:00] [INFO ] Deduced a trap composed of 35 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:21:01] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 6 ms to minimize.
[2024-06-01 13:21:01] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:21:01] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 5 ms to minimize.
[2024-06-01 13:21:02] [INFO ] Deduced a trap composed of 26 places in 433 ms of which 6 ms to minimize.
[2024-06-01 13:21:02] [INFO ] Deduced a trap composed of 35 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:21:03] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 6 ms to minimize.
[2024-06-01 13:21:03] [INFO ] Deduced a trap composed of 28 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:21:04] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 5 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 20 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 5 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 60 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:21:13] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:21:13] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:21:14] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:21:14] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 4 ms to minimize.
SMT process timed out in 75209ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Fused 359 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 264 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 56 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 99095 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 359/359 properties
Interrupted probabilistic random walk after 7099136 steps, run timeout after 90001 ms. (steps per millisecond=78 ) properties seen :0 out of 359
Probabilistic random walk after 7099136 steps, saw 892448 distinct states, run finished after 90002 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 13:23:15] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:23:15] [INFO ] Invariant cache hit.
[2024-06-01 13:23:15] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (OVERLAPS) 134/398 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 134/417 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:23:25] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 3 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 12 places in 484 ms of which 5 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 41 places in 416 ms of which 4 ms to minimize.
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 6 ms to minimize.
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 28 places in 465 ms of which 5 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 6 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 18 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 6 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:23:32] [INFO ] Deduced a trap composed of 40 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:23:32] [INFO ] Deduced a trap composed of 32 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:23:32] [INFO ] Deduced a trap composed of 30 places in 434 ms of which 6 ms to minimize.
[2024-06-01 13:23:33] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 4 ms to minimize.
[2024-06-01 13:23:33] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:23:34] [INFO ] Deduced a trap composed of 39 places in 486 ms of which 6 ms to minimize.
[2024-06-01 13:23:35] [INFO ] Deduced a trap composed of 26 places in 488 ms of which 6 ms to minimize.
[2024-06-01 13:23:35] [INFO ] Deduced a trap composed of 21 places in 491 ms of which 7 ms to minimize.
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 52 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 6 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 29 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 5 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 6 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 6 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 6 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 3 ms to minimize.
[2024-06-01 13:23:41] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:23:41] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 6 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 58 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 6 ms to minimize.
[2024-06-01 13:23:43] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:23:47] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:23:48] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:23:48] [INFO ] Deduced a trap composed of 82 places in 329 ms of which 5 ms to minimize.
[2024-06-01 13:23:48] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 6 ms to minimize.
[2024-06-01 13:23:49] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 6 ms to minimize.
[2024-06-01 13:23:49] [INFO ] Deduced a trap composed of 62 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:23:50] [INFO ] Deduced a trap composed of 81 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:23:50] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:23:51] [INFO ] Deduced a trap composed of 83 places in 474 ms of which 5 ms to minimize.
[2024-06-01 13:23:51] [INFO ] Deduced a trap composed of 99 places in 458 ms of which 6 ms to minimize.
[2024-06-01 13:23:52] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 6 ms to minimize.
[2024-06-01 13:23:52] [INFO ] Deduced a trap composed of 103 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:23:53] [INFO ] Deduced a trap composed of 14 places in 345 ms of which 3 ms to minimize.
[2024-06-01 13:23:53] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 3 ms to minimize.
[2024-06-01 13:23:53] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:23:53] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:23:54] [INFO ] Deduced a trap composed of 58 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:23:54] [INFO ] Deduced a trap composed of 35 places in 446 ms of which 6 ms to minimize.
[2024-06-01 13:23:55] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 6 ms to minimize.
[2024-06-01 13:23:55] [INFO ] Deduced a trap composed of 14 places in 445 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:23:56] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 22 places in 420 ms of which 6 ms to minimize.
[2024-06-01 13:23:57] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:23:58] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:23:58] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 6 ms to minimize.
[2024-06-01 13:23:59] [INFO ] Deduced a trap composed of 48 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:23:59] [INFO ] Deduced a trap composed of 71 places in 477 ms of which 6 ms to minimize.
[2024-06-01 13:24:00] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 6 ms to minimize.
[2024-06-01 13:24:00] [INFO ] Deduced a trap composed of 10 places in 464 ms of which 7 ms to minimize.
[2024-06-01 13:24:01] [INFO ] Deduced a trap composed of 21 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:24:01] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 6 ms to minimize.
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 27 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 25 places in 450 ms of which 5 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 10 places in 453 ms of which 6 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 6 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 6 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 44 places in 429 ms of which 5 ms to minimize.
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 5 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 6 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 19 places in 453 ms of which 6 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 51 places in 423 ms of which 7 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 5 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 6 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 50 places in 445 ms of which 6 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 33 places in 410 ms of which 5 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 20 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 35 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 27 places in 446 ms of which 6 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 6 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 36 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 26 places in 442 ms of which 6 ms to minimize.
[2024-06-01 13:24:14] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 6 ms to minimize.
[2024-06-01 13:24:14] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:24:15] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:24:15] [INFO ] Deduced a trap composed of 26 places in 466 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 12 places in 475 ms of which 5 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 20 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 51 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 4 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 60 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:24:27] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:24:27] [INFO ] Deduced a trap composed of 13 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 38 places in 298 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 36 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 4 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 5 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:24:33] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:24:33] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:24:33] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 45 places in 387 ms of which 6 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 30 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 70 places in 405 ms of which 6 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 34 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-01 13:24:40] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:24:40] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 5 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 18 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 6 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 43 places in 432 ms of which 3 ms to minimize.
[2024-06-01 13:24:45] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:24:45] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 4 ms to minimize.
SMT process timed out in 90130ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Fused 359 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 264 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 30 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 21 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:24:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:24:45] [INFO ] Invariant cache hit.
[2024-06-01 13:24:45] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 13:24:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:24:45] [INFO ] Invariant cache hit.
[2024-06-01 13:24:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:24:46] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-06-01 13:24:47] [INFO ] Redundant transitions in 115 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:24:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:24:47] [INFO ] Invariant cache hit.
[2024-06-01 13:24:47] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 50 places in 571 ms of which 6 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 10 places in 536 ms of which 6 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 64 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 27 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 6 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 58 places in 336 ms of which 5 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 81 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 5 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 3 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 6 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 3 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 53 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 6 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 6 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 6 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 21 places in 464 ms of which 6 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 19 places in 454 ms of which 7 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 6 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:25:16] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 5 ms to minimize.
[2024-06-01 13:25:16] [INFO ] Deduced a trap composed of 26 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 41 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 5 ms to minimize.
SMT process timed out in 30889ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32673 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 400000 steps (8 resets) in 8930 ms. (44 steps per ms) remains 158/264 properties
Running SMT prover for 158 properties.
[2024-06-01 13:25:20] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:25:20] [INFO ] Invariant cache hit.
[2024-06-01 13:25:20] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-06-01 13:25:21] [INFO ] After 850ms SMT Verify possible using state equation in real domain returned unsat :0 sat :158
[2024-06-01 13:25:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:25:22] [INFO ] After 998ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :158
TRAPS : Iteration 0
[2024-06-01 13:25:37] [INFO ] After 15455ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:158
[2024-06-01 13:25:37] [INFO ] After 16649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:158
[2024-06-01 13:25:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2024-06-01 13:25:38] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :158
[2024-06-01 13:25:39] [INFO ] After 1270ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :158
TRAPS : Iteration 0
[2024-06-01 13:25:40] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 6 ms to minimize.
[2024-06-01 13:25:40] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:25:40] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 44 places in 346 ms of which 6 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 15 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 5 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 12 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:25:44] [INFO ] Deduced a trap composed of 12 places in 481 ms of which 9 ms to minimize.
[2024-06-01 13:25:44] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 5 ms to minimize.
[2024-06-01 13:25:45] [INFO ] Deduced a trap composed of 13 places in 459 ms of which 6 ms to minimize.
[2024-06-01 13:25:45] [INFO ] Deduced a trap composed of 44 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 5 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 35 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:25:47] [INFO ] Deduced a trap composed of 20 places in 430 ms of which 5 ms to minimize.
[2024-06-01 13:25:47] [INFO ] Deduced a trap composed of 20 places in 429 ms of which 5 ms to minimize.
[2024-06-01 13:25:48] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 6 ms to minimize.
[2024-06-01 13:25:48] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:25:48] [INFO ] Deduced a trap composed of 76 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:25:49] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 5 ms to minimize.
[2024-06-01 13:25:49] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:25:50] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:25:50] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:25:50] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:25:51] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:25:51] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:25:51] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 3 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 15 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 4 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 21080 ms
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 52 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 5 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 4 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 14 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 83 places in 376 ms of which 4 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 5 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 4 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8648 ms
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 4 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 10 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2330 ms
[2024-06-01 13:26:12] [INFO ] Deduced a trap composed of 21 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 12 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 5 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 4 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 3 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:26:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4239 ms
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:26:17] [INFO ] Deduced a trap composed of 53 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:26:17] [INFO ] Deduced a trap composed of 66 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:26:18] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:26:18] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 26 places in 349 ms of which 5 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 4 ms to minimize.
[2024-06-01 13:26:22] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:26:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5802 ms
[2024-06-01 13:26:22] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 5 ms to minimize.
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 51 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:26:24] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:26:24] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2956 ms
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 4 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 6 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 5 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 5 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 91 places in 377 ms of which 5 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 5 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 39 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6129 ms
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 5 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 832 ms
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 4 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 10 places in 463 ms of which 5 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Deduced a trap composed of 18 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Deduced a trap composed of 10 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1550 ms
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 5 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 26 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 26 places in 427 ms of which 5 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Deduced a trap composed of 40 places in 420 ms of which 8 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 5 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2341 ms
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 61 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 5 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 4 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 61 places in 340 ms of which 4 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 61 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 55 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6334 ms
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 5 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2026 ms
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 22 places in 394 ms of which 4 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 4 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 54 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 61 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 60 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 54 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4345 ms
[2024-06-01 13:26:53] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-06-01 13:26:53] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2024-06-01 13:26:54] [INFO ] Deduced a trap composed of 50 places in 339 ms of which 5 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1740 ms
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 18 places in 470 ms of which 6 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 5 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1112 ms
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 51 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 52 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 44 places in 342 ms of which 5 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2141 ms
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 5 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 20 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1965 ms
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1099 ms
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 996 ms
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 5 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 6 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 52 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1916 ms
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 52 places in 433 ms of which 5 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 43 places in 427 ms of which 5 ms to minimize.
[2024-06-01 13:27:10] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:27:10] [INFO ] Deduced a trap composed of 44 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 45 places in 385 ms of which 5 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 27 places in 401 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 27 places in 380 ms of which 4 ms to minimize.
[2024-06-01 13:27:13] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 5 ms to minimize.
[2024-06-01 13:27:13] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:27:14] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 5 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 5 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 64 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 60 places in 336 ms of which 5 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 4 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 5 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 5 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 12555 ms
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 529 ms
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 4 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1349 ms
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 5 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:27:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3228 ms
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 4 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2024-06-01 13:27:29] [INFO ] Deduced a trap composed of 58 places in 318 ms of which 5 ms to minimize.
[2024-06-01 13:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 81 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:27:31] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 4 ms to minimize.
[2024-06-01 13:27:31] [INFO ] Deduced a trap composed of 45 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:27:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2208 ms
[2024-06-01 13:27:32] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:27:32] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:27:33] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:27:33] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:27:33] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 3 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 3 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2739 ms
[2024-06-01 13:27:35] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2024-06-01 13:27:36] [INFO ] Deduced a trap composed of 49 places in 337 ms of which 5 ms to minimize.
[2024-06-01 13:27:36] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:27:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1380 ms
[2024-06-01 13:27:37] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:27:38] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 5 ms to minimize.
[2024-06-01 13:27:38] [INFO ] Deduced a trap composed of 48 places in 346 ms of which 5 ms to minimize.
[2024-06-01 13:27:38] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 5 ms to minimize.
[2024-06-01 13:27:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1744 ms
[2024-06-01 13:27:39] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:27:39] [INFO ] Deduced a trap composed of 51 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 46 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 5 ms to minimize.
[2024-06-01 13:27:42] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:27:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3486 ms
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 5 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 5 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1395 ms
[2024-06-01 13:27:46] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:27:47] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:27:47] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 4 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2627 ms
[2024-06-01 13:27:49] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-06-01 13:27:50] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-01 13:27:52] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:27:52] [INFO ] Deduced a trap composed of 57 places in 365 ms of which 4 ms to minimize.
[2024-06-01 13:27:53] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1380 ms
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-06-01 13:27:57] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:27:57] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:27:58] [INFO ] Deduced a trap composed of 58 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:27:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1239 ms
[2024-06-01 13:27:58] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2024-06-01 13:27:59] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 5 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
[2024-06-01 13:28:02] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-06-01 13:28:05] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:28:05] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:28:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 76 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-06-01 13:28:10] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:28:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:28:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1103 ms
[2024-06-01 13:28:16] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2024-06-01 13:28:16] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2024-06-01 13:28:18] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2024-06-01 13:28:19] [INFO ] Deduced a trap composed of 84 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 45 places in 378 ms of which 5 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1514 ms
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
TRAPS : Iteration 1
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 10 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2024-06-01 13:28:26] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-06-01 13:28:27] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-06-01 13:28:29] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:28:29] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2024-06-01 13:28:36] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:28:36] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:28:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 623 ms
[2024-06-01 13:28:38] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 4 ms to minimize.
[2024-06-01 13:28:38] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:28:39] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:28:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 853 ms
[2024-06-01 13:28:40] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 5 ms to minimize.
[2024-06-01 13:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2024-06-01 13:28:45] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2024-06-01 13:28:48] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 82 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 11 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2024-06-01 13:28:56] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 872 ms
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
TRAPS : Iteration 2
[2024-06-01 13:28:57] [INFO ] After 198713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :157
[2024-06-01 13:28:57] [INFO ] After 200017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :157
RANDOM walk for 4000000 steps (8 resets) in 101574 ms. (39 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 359/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 358/359 properties
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 358/358 properties
Interrupted probabilistic random walk after 6161000 steps, run timeout after 102001 ms. (steps per millisecond=60 ) properties seen :0 out of 358
Probabilistic random walk after 6161000 steps, saw 778216 distinct states, run finished after 102002 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-01 13:31:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:31:14] [INFO ] Invariant cache hit.
[2024-06-01 13:31:14] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 134/398 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 134/417 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 7 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 10 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 5 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 5 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 12 places in 442 ms of which 5 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 6 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 5 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 6 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 3 ms to minimize.
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 3 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 13 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 18 places in 482 ms of which 6 ms to minimize.
[2024-06-01 13:31:33] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 5 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 66 places in 440 ms of which 5 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 70 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 53 places in 461 ms of which 6 ms to minimize.
[2024-06-01 13:31:37] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:31:37] [INFO ] Deduced a trap composed of 14 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 62 places in 482 ms of which 5 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 10 places in 462 ms of which 6 ms to minimize.
[2024-06-01 13:31:39] [INFO ] Deduced a trap composed of 14 places in 467 ms of which 6 ms to minimize.
[2024-06-01 13:31:39] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 5 ms to minimize.
[2024-06-01 13:31:40] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 5 ms to minimize.
[2024-06-01 13:31:40] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 6 ms to minimize.
[2024-06-01 13:31:41] [INFO ] Deduced a trap composed of 71 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:31:41] [INFO ] Deduced a trap composed of 41 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:31:41] [INFO ] Deduced a trap composed of 30 places in 452 ms of which 6 ms to minimize.
[2024-06-01 13:31:42] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 6 ms to minimize.
[2024-06-01 13:31:42] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 6 ms to minimize.
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 5 ms to minimize.
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 23 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:31:44] [INFO ] Deduced a trap composed of 25 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:31:44] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 10 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 64 places in 452 ms of which 5 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 44 places in 458 ms of which 6 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 5 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 11 places in 450 ms of which 6 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 5 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 53 places in 442 ms of which 5 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 28 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 6 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 28 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 6 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 19 places in 459 ms of which 6 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:32:01] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:32:01] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 6 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 50 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 52 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 15 places in 423 ms of which 6 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 5 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 20 places in 435 ms of which 6 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 14 places in 466 ms of which 5 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 4 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 75 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 5 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 5 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 5 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 4 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:32:24] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:32:24] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:32:25] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:32:25] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 41 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 6 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 45 places in 393 ms of which 4 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:32:30] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:32:30] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 5 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 22 places in 385 ms of which 5 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 5 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 30 places in 447 ms of which 3 ms to minimize.
[2024-06-01 13:32:32] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:32:32] [INFO ] Deduced a trap composed of 58 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:32:32] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 5 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 37 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 65 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 5 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 45 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 65 places in 352 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 4 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 10 places in 488 ms of which 6 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 52 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 21 places in 484 ms of which 5 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 50 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 34 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 4 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 44 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 5 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 62 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:32:47] [INFO ] Deduced a trap composed of 36 places in 384 ms of which 15 ms to minimize.
[2024-06-01 13:32:47] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 6 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 27 places in 415 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 5 ms to minimize.
SMT process timed out in 105382ms, After SMT, problems are : Problem set: 0 solved, 358 unsolved
Fused 358 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 264 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 33 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 1877120 steps (4 resets) in 120004 ms. (15 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 358/358 properties
Interrupted probabilistic random walk after 6165744 steps, run timeout after 108001 ms. (steps per millisecond=57 ) properties seen :0 out of 358
Probabilistic random walk after 6165744 steps, saw 778701 distinct states, run finished after 108002 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 13:35:23] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:35:23] [INFO ] Invariant cache hit.
[2024-06-01 13:35:23] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 134/398 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 134/417 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:35:36] [INFO ] Deduced a trap composed of 61 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:35:36] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 6 ms to minimize.
[2024-06-01 13:35:37] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:35:37] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:35:38] [INFO ] Deduced a trap composed of 31 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:35:38] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 12 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 14 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 39 places in 487 ms of which 6 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 18 places in 459 ms of which 6 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 10 places in 456 ms of which 3 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 3 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 3 ms to minimize.
[2024-06-01 13:35:42] [INFO ] Deduced a trap composed of 47 places in 480 ms of which 6 ms to minimize.
[2024-06-01 13:35:42] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:35:42] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 3 ms to minimize.
[2024-06-01 13:35:43] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 9 ms to minimize.
[2024-06-01 13:35:43] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 3 ms to minimize.
[2024-06-01 13:35:43] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 5 ms to minimize.
[2024-06-01 13:35:44] [INFO ] Deduced a trap composed of 14 places in 449 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 66 places in 443 ms of which 5 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 70 places in 496 ms of which 5 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 53 places in 443 ms of which 6 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 6 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 14 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 62 places in 487 ms of which 6 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 10 places in 388 ms of which 6 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 14 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 5 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 5 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 71 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 41 places in 413 ms of which 6 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 30 places in 474 ms of which 6 ms to minimize.
[2024-06-01 13:35:51] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 5 ms to minimize.
[2024-06-01 13:35:51] [INFO ] Deduced a trap composed of 12 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 5 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 6 ms to minimize.
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 25 places in 475 ms of which 6 ms to minimize.
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 44 places in 490 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 5 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 6 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 64 places in 451 ms of which 5 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 12 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 36 places in 421 ms of which 6 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 5 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 35 places in 426 ms of which 6 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 36 places in 433 ms of which 5 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 53 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 27 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 58 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 19 places in 452 ms of which 5 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 20 places in 431 ms of which 5 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 20 places in 464 ms of which 6 ms to minimize.
[2024-06-01 13:36:10] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 5 ms to minimize.
[2024-06-01 13:36:10] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 6 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 57 places in 331 ms of which 5 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 39 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 46 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 5 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 5 ms to minimize.
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 14 places in 474 ms of which 5 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 23 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 74 places in 383 ms of which 4 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 59 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 27 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:36:30] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 5 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 43 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 28 places in 437 ms of which 6 ms to minimize.
[2024-06-01 13:36:33] [INFO ] Deduced a trap composed of 20 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:36:33] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:36:33] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:36:34] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 6 ms to minimize.
[2024-06-01 13:36:34] [INFO ] Deduced a trap composed of 30 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:36:35] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:36:35] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 6 ms to minimize.
[2024-06-01 13:36:35] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 6 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:36:37] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 4 ms to minimize.
[2024-06-01 13:36:37] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:36:37] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:36:38] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:36:40] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 5 ms to minimize.
[2024-06-01 13:36:41] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 5 ms to minimize.
[2024-06-01 13:36:41] [INFO ] Deduced a trap composed of 22 places in 511 ms of which 5 ms to minimize.
[2024-06-01 13:36:41] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 30 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:36:43] [INFO ] Deduced a trap composed of 58 places in 468 ms of which 5 ms to minimize.
[2024-06-01 13:36:43] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:36:44] [INFO ] Deduced a trap composed of 35 places in 417 ms of which 5 ms to minimize.
[2024-06-01 13:36:44] [INFO ] Deduced a trap composed of 29 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:36:44] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 4 ms to minimize.
[2024-06-01 13:36:45] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:36:45] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 4 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 5 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 65 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 45 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 65 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:36:48] [INFO ] Deduced a trap composed of 65 places in 344 ms of which 4 ms to minimize.
[2024-06-01 13:36:48] [INFO ] Deduced a trap composed of 29 places in 530 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 6 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 41 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 63 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 10 places in 581 ms of which 6 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 52 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 50 places in 456 ms of which 5 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 5 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 50 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 52 places in 392 ms of which 7 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 62 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 42 places in 397 ms of which 6 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 5 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 6 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 18 places in 445 ms of which 5 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 14 places in 452 ms of which 5 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 5 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 78 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 84 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 77 places in 348 ms of which 5 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 4 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 27 places in 354 ms of which 4 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 38 places in 333 ms of which 5 ms to minimize.
SMT process timed out in 120480ms, After SMT, problems are : Problem set: 0 solved, 358 unsolved
Fused 358 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 264 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 29 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:37:24] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:37:24] [INFO ] Invariant cache hit.
[2024-06-01 13:37:24] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-06-01 13:37:24] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:37:24] [INFO ] Invariant cache hit.
[2024-06-01 13:37:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:37:25] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2024-06-01 13:37:25] [INFO ] Redundant transitions in 53 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:37:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:37:25] [INFO ] Invariant cache hit.
[2024-06-01 13:37:25] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 50 places in 502 ms of which 7 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 10 places in 527 ms of which 6 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 19 places in 463 ms of which 6 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 64 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 54 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 5 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 5 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 81 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:37:47] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:37:47] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 5 ms to minimize.
[2024-06-01 13:37:47] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 5 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 55 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 29 places in 454 ms of which 6 ms to minimize.
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 5 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 53 places in 459 ms of which 5 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 23 places in 448 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 51 places in 508 ms of which 6 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 64 places in 489 ms of which 6 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 20 places in 531 ms of which 5 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 5 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 27 places in 509 ms of which 6 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 5 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 6 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 19 places in 492 ms of which 5 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 45 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 3 ms to minimize.
SMT process timed out in 30520ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32447 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 400000 steps (8 resets) in 18032 ms. (22 steps per ms) remains 156/264 properties
Running SMT prover for 156 properties.
[2024-06-01 13:38:01] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:38:01] [INFO ] Invariant cache hit.
[2024-06-01 13:38:01] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-06-01 13:38:02] [INFO ] After 516ms SMT Verify possible using state equation in real domain returned unsat :0 sat :156
[2024-06-01 13:38:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:38:03] [INFO ] After 841ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :156
TRAPS : Iteration 0
[2024-06-01 13:38:15] [INFO ] After 13129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:156
[2024-06-01 13:38:15] [INFO ] After 13945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:156
[2024-06-01 13:38:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2024-06-01 13:38:17] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :156
[2024-06-01 13:38:18] [INFO ] After 1366ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :156
TRAPS : Iteration 0
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 13 places in 511 ms of which 6 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 32 places in 504 ms of which 7 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 6 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 32 places in 497 ms of which 6 ms to minimize.
[2024-06-01 13:38:21] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 6 ms to minimize.
[2024-06-01 13:38:22] [INFO ] Deduced a trap composed of 41 places in 499 ms of which 6 ms to minimize.
[2024-06-01 13:38:22] [INFO ] Deduced a trap composed of 14 places in 517 ms of which 6 ms to minimize.
[2024-06-01 13:38:23] [INFO ] Deduced a trap composed of 36 places in 507 ms of which 6 ms to minimize.
[2024-06-01 13:38:23] [INFO ] Deduced a trap composed of 20 places in 468 ms of which 5 ms to minimize.
[2024-06-01 13:38:24] [INFO ] Deduced a trap composed of 30 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:38:24] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:38:25] [INFO ] Deduced a trap composed of 33 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:38:25] [INFO ] Deduced a trap composed of 26 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:38:26] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:38:26] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 6 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 65 places in 467 ms of which 5 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 13 places in 492 ms of which 6 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 21 places in 500 ms of which 6 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 6 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 19 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 52 places in 463 ms of which 6 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 58 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 19 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 15 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 54 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 36 places in 485 ms of which 6 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 6 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 52 places in 485 ms of which 6 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 5 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 37 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 37 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:38:37] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:38:37] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 5 ms to minimize.
[2024-06-01 13:38:38] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:38:38] [INFO ] Deduced a trap composed of 37 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:38:38] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:38:39] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:38:39] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:38:39] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 21616 ms
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 28 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:38:41] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 5 ms to minimize.
[2024-06-01 13:38:41] [INFO ] Deduced a trap composed of 30 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:38:42] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:38:42] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 27 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 18 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 4 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 5 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 5 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 7 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 20 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10978 ms
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 45 places in 431 ms of which 6 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 37 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 934 ms
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 23 places in 440 ms of which 6 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 10 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2392 ms
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 5 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 58 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1859 ms
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 6 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 59 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 5 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4628 ms
[2024-06-01 13:39:02] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:39:02] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:39:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 822 ms
[2024-06-01 13:39:03] [INFO ] Deduced a trap composed of 25 places in 500 ms of which 6 ms to minimize.
[2024-06-01 13:39:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 602 ms
[2024-06-01 13:39:04] [INFO ] Deduced a trap composed of 34 places in 462 ms of which 6 ms to minimize.
[2024-06-01 13:39:04] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:39:05] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:39:05] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 37 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 4 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3111 ms
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 5 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 10 places in 424 ms of which 6 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 944 ms
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 36 places in 467 ms of which 5 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 40 places in 430 ms of which 5 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1057 ms
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 35 places in 439 ms of which 5 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 5 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 61 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2168 ms
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 53 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2426 ms
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 7 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 31 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 54 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5953 ms
[2024-06-01 13:39:21] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 5 ms to minimize.
[2024-06-01 13:39:21] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:21] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:39:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1029 ms
[2024-06-01 13:39:22] [INFO ] Deduced a trap composed of 52 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:39:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2024-06-01 13:39:23] [INFO ] Deduced a trap composed of 34 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:39:23] [INFO ] Deduced a trap composed of 50 places in 438 ms of which 6 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 50 places in 421 ms of which 6 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 42 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 5 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 4 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 7 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 59 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 12 places in 380 ms of which 4 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:39:31] [INFO ] Deduced a trap composed of 27 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 5 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 50 places in 290 ms of which 5 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 50 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 26 places in 356 ms of which 4 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:39:35] [INFO ] Deduced a trap composed of 26 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:39:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 12466 ms
[2024-06-01 13:39:35] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 5 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:39:38] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:39:38] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:39:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3443 ms
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 52 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2053 ms
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 881 ms
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 73 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:39:43] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:39:43] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:39:43] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:39:44] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:39:44] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 30 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 27 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:39:48] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:39:48] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:39:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6631 ms
[2024-06-01 13:39:49] [INFO ] Deduced a trap composed of 43 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:39:49] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:39:50] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 5 ms to minimize.
[2024-06-01 13:39:50] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 5 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 15 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3444 ms
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 27 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1548 ms
[2024-06-01 13:39:54] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 24 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 6 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 64 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 44 places in 334 ms of which 4 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2557 ms
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 502 ms
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:39:59] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 5 ms to minimize.
[2024-06-01 13:39:59] [INFO ] Deduced a trap composed of 48 places in 452 ms of which 6 ms to minimize.
[2024-06-01 13:40:00] [INFO ] Deduced a trap composed of 22 places in 460 ms of which 5 ms to minimize.
[2024-06-01 13:40:00] [INFO ] Deduced a trap composed of 54 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:40:00] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:40:00] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:40:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2896 ms
[2024-06-01 13:40:01] [INFO ] Deduced a trap composed of 12 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 53 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 65 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 65 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 65 places in 385 ms of which 5 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 59 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4186 ms
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 44 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1702 ms
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 76 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 84 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 61 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2877 ms
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 5 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 5 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 4 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 6 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1443 ms
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 5 ms to minimize.
[2024-06-01 13:40:15] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 5 ms to minimize.
[2024-06-01 13:40:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 883 ms
[2024-06-01 13:40:15] [INFO ] Deduced a trap composed of 46 places in 322 ms of which 5 ms to minimize.
[2024-06-01 13:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2024-06-01 13:40:16] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 5 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 964 ms
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2024-06-01 13:40:18] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 727 ms
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:40:20] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:40:20] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2109 ms
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 5 ms to minimize.
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1132 ms
[2024-06-01 13:40:24] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 4 ms to minimize.
[2024-06-01 13:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2024-06-01 13:40:24] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:40:25] [INFO ] Deduced a trap composed of 55 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:40:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 799 ms
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2024-06-01 13:40:28] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:40:28] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:40:28] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:40:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1191 ms
[2024-06-01 13:40:30] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:40:30] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:40:31] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 4 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 48 places in 429 ms of which 5 ms to minimize.
[2024-06-01 13:40:32] [INFO ] Deduced a trap composed of 30 places in 456 ms of which 5 ms to minimize.
[2024-06-01 13:40:33] [INFO ] Deduced a trap composed of 10 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:40:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3523 ms
[2024-06-01 13:40:34] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2024-06-01 13:40:34] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 2 ms to minimize.
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 5 ms to minimize.
[2024-06-01 13:40:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1171 ms
[2024-06-01 13:40:38] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-06-01 13:40:38] [INFO ] Deduced a trap composed of 65 places in 371 ms of which 4 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 868 ms
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2024-06-01 13:40:41] [INFO ] Deduced a trap composed of 21 places in 454 ms of which 6 ms to minimize.
[2024-06-01 13:40:41] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 6 ms to minimize.
[2024-06-01 13:40:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1088 ms
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 60 places in 377 ms of which 4 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 39 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 50 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 3 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3527 ms
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 42 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 55 places in 366 ms of which 4 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1054 ms
[2024-06-01 13:40:47] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 4 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:40:51] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:40:51] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:40:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 519 ms
[2024-06-01 13:40:51] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:40:51] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:40:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2024-06-01 13:40:52] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 877 ms
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 969 ms
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-01 13:40:55] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2024-06-01 13:40:56] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:40:56] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:40:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2024-06-01 13:40:56] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2024-06-01 13:40:57] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:40:57] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:40:57] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:40:57] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:40:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 737 ms
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:40:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
TRAPS : Iteration 1
[2024-06-01 13:40:59] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-06-01 13:41:02] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-06-01 13:41:04] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-01 13:41:05] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:41:05] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:41:06] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:41:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 902 ms
[2024-06-01 13:41:06] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:41:06] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:41:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2024-06-01 13:41:07] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:41:08] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:41:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1160 ms
[2024-06-01 13:41:08] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:41:09] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:41:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 601 ms
[2024-06-01 13:41:09] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:41:09] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:41:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 4 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:41:13] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:41:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1367 ms
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-06-01 13:41:17] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-06-01 13:41:19] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-06-01 13:41:20] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:41:20] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:41:21] [INFO ] Deduced a trap composed of 52 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:41:21] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:41:21] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 53 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 53 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:41:23] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:41:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2691 ms
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 626 ms
[2024-06-01 13:41:34] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
TRAPS : Iteration 2
[2024-06-01 13:41:35] [INFO ] After 198617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :155
[2024-06-01 13:41:35] [INFO ] After 200019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :155
RANDOM walk for 64 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 53 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 85 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 38 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 33 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 38 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 31 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 30235 steps (6 resets) in 171 ms. (175 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38901 steps (8 resets) in 164 ms. (235 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 349678 steps, run visited all 1 properties in 1736 ms. (steps per millisecond=201 )
Probabilistic random walk after 349678 steps, saw 48531 distinct states, run finished after 1744 ms. (steps per millisecond=200 ) properties seen :1
RANDOM walk for 37137 steps (8 resets) in 159 ms. (232 steps per ms) remains 0/1 properties
RANDOM walk for 34023 steps (7 resets) in 182 ms. (185 steps per ms) remains 0/1 properties
RANDOM walk for 33477 steps (7 resets) in 102 ms. (325 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31412 steps (6 resets) in 33 ms. (923 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 763584 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 763584 steps, saw 102212 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2024-06-01 13:41:41] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:41:41] [INFO ] Invariant cache hit.
[2024-06-01 13:41:41] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:41:43] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 6 ms to minimize.
[2024-06-01 13:41:43] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 6 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 42 places in 523 ms of which 6 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 19 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 5 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 12 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 26 places in 492 ms of which 5 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 6 ms to minimize.
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 42 places in 426 ms of which 5 ms to minimize.
SMT process timed out in 5893ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 50 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753648 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753648 steps, saw 101214 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2024-06-01 13:41:50] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:41:50] [INFO ] Invariant cache hit.
[2024-06-01 13:41:50] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 667 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 21 places in 561 ms of which 6 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 14 places in 525 ms of which 6 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 42 places in 578 ms of which 10 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 6 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 10 places in 543 ms of which 6 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 12 places in 524 ms of which 6 ms to minimize.
[2024-06-01 13:41:55] [INFO ] Deduced a trap composed of 26 places in 544 ms of which 6 ms to minimize.
[2024-06-01 13:41:55] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 6 ms to minimize.
[2024-06-01 13:41:56] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 9/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1295 variables, 234/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1295 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1295 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5915 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 30 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 42 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:41:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:41:57] [INFO ] Invariant cache hit.
[2024-06-01 13:41:57] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-06-01 13:41:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:41:57] [INFO ] Invariant cache hit.
[2024-06-01 13:41:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:42:00] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
[2024-06-01 13:42:00] [INFO ] Redundant transitions in 20 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:42:00] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:42:00] [INFO ] Invariant cache hit.
[2024-06-01 13:42:00] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 50 places in 533 ms of which 7 ms to minimize.
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 6 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 19 places in 489 ms of which 5 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 64 places in 406 ms of which 5 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 5 ms to minimize.
[2024-06-01 13:42:19] [INFO ] Deduced a trap composed of 58 places in 401 ms of which 6 ms to minimize.
[2024-06-01 13:42:19] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:42:19] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 5 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 4 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 62 places in 449 ms of which 5 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 6 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 55 places in 435 ms of which 5 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 53 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 51 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 64 places in 483 ms of which 5 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 20 places in 488 ms of which 6 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 5 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 5 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 19 places in 469 ms of which 6 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 3 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 46 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 6 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 5 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 51 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 59 places in 402 ms of which 5 ms to minimize.
SMT process timed out in 30484ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34144 ms. Remains : 399/399 places, 1106/1106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 8 ms
Free SCC test removed 248 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 70 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:42:31] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:42:31] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:42:31] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:42:31] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:42:31] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
RANDOM walk for 37 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 777424 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 777424 steps, saw 104158 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-01 13:42:34] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2024-06-01 13:42:34] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 13:42:34] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:35] [INFO ] Deduced a trap composed of 24 places in 527 ms of which 6 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 27 places in 450 ms of which 6 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 21 places in 513 ms of which 6 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 34 places in 504 ms of which 6 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 10 places in 494 ms of which 6 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 23 places in 492 ms of which 6 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 6 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 41 places in 434 ms of which 5 ms to minimize.
[2024-06-01 13:42:40] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 5 ms to minimize.
SMT process timed out in 5932ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 693168 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 693168 steps, saw 91558 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-06-01 13:42:43] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:42:43] [INFO ] Invariant cache hit.
[2024-06-01 13:42:43] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 21 places in 570 ms of which 6 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 51 places in 510 ms of which 6 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 52 places in 492 ms of which 6 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 10 places in 484 ms of which 6 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 27 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 30 places in 494 ms of which 6 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 27 places in 497 ms of which 6 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 6 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 37 places in 475 ms of which 5 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 15 places in 457 ms of which 5 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 11 places in 451 ms of which 6 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 6 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 5 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 15/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1295 variables, 234/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1295 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1295 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7965 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 8513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 31 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 24 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:42:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:42:52] [INFO ] Invariant cache hit.
[2024-06-01 13:42:52] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 13:42:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:42:52] [INFO ] Invariant cache hit.
[2024-06-01 13:42:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:42:54] [INFO ] Implicit Places using invariants and state equation in 2152 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
[2024-06-01 13:42:54] [INFO ] Redundant transitions in 13 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:42:54] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:42:54] [INFO ] Invariant cache hit.
[2024-06-01 13:42:54] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:04] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:43:05] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:43:05] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:43:05] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:43:05] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 81 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/1295 variables, and 459 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30027 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 40/459 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 5 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 48 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 5 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 27 places in 368 ms of which 4 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 44 places in 346 ms of which 5 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 4 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 64 places in 374 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 4 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 50 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 5 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:43:40] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:43:40] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:43:40] [INFO ] Deduced a trap composed of 58 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 58 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 44 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 6 ms to minimize.
[2024-06-01 13:43:46] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:43:46] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:43:46] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 5 ms to minimize.
[2024-06-01 13:43:47] [INFO ] Deduced a trap composed of 88 places in 328 ms of which 4 ms to minimize.
[2024-06-01 13:43:47] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:43:47] [INFO ] Deduced a trap composed of 30 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 36 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 29 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:43:50] [INFO ] Deduced a trap composed of 51 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:43:50] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:43:51] [INFO ] Deduced a trap composed of 12 places in 445 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 5 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:43:54] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 55 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 4 ms to minimize.
SMT process timed out in 60787ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 60804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63583 ms. Remains : 399/399 places, 1106/1106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 2 ms
Free SCC test removed 248 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 38 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:43:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:43:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:43:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:43:55] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:43:55] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:43:55] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 116 ms.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 701832 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 701832 steps, saw 92348 distinct states, run finished after 3004 ms. (steps per millisecond=233 ) properties seen :0
[2024-06-01 13:43:58] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2024-06-01 13:43:58] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 13:43:58] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 40 places in 516 ms of which 6 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 19 places in 503 ms of which 6 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 24 places in 524 ms of which 7 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 7 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 23 places in 511 ms of which 6 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 15 places in 449 ms of which 6 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 49 places in 491 ms of which 6 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 5 ms to minimize.
SMT process timed out in 5630ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 32 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 679328 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 1
Probabilistic random walk after 679328 steps, saw 90349 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
[2024-06-01 13:44:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:44:07] [INFO ] Invariant cache hit.
[2024-06-01 13:44:07] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 6 ms to minimize.
[2024-06-01 13:44:09] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 7 ms to minimize.
[2024-06-01 13:44:09] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 6 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 6 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 58 places in 508 ms of which 6 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 13 places in 475 ms of which 6 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 6 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 10 places in 474 ms of which 6 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 6 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 11/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:14] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:44:14] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 22 places in 403 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1103 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 192/1295 variables, 234/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1295 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1295 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7547 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 8041ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 25 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:44:15] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:44:15] [INFO ] Invariant cache hit.
[2024-06-01 13:44:16] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-06-01 13:44:16] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:44:16] [INFO ] Invariant cache hit.
[2024-06-01 13:44:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:44:19] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 4094 ms to find 0 implicit places.
[2024-06-01 13:44:19] [INFO ] Redundant transitions in 35 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:44:19] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:44:19] [INFO ] Invariant cache hit.
[2024-06-01 13:44:19] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 50 places in 503 ms of which 7 ms to minimize.
[2024-06-01 13:44:35] [INFO ] Deduced a trap composed of 10 places in 501 ms of which 6 ms to minimize.
[2024-06-01 13:44:35] [INFO ] Deduced a trap composed of 19 places in 503 ms of which 6 ms to minimize.
[2024-06-01 13:44:36] [INFO ] Deduced a trap composed of 64 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:44:36] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 5 ms to minimize.
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 5 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 81 places in 363 ms of which 4 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 43 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:44:39] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:44:39] [INFO ] Deduced a trap composed of 62 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 5 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 55 places in 445 ms of which 6 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 6 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 53 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:44:43] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:44:43] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 6 ms to minimize.
[2024-06-01 13:44:46] [INFO ] Deduced a trap composed of 46 places in 483 ms of which 6 ms to minimize.
[2024-06-01 13:44:46] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 6 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 36 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 51 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 5 ms to minimize.
[2024-06-01 13:44:49] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 5 ms to minimize.
[2024-06-01 13:44:49] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:44:49] [INFO ] Deduced a trap composed of 74 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:44:50] [INFO ] Deduced a trap composed of 41 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:44:50] [INFO ] Deduced a trap composed of 37 places in 353 ms of which 5 ms to minimize.
SMT process timed out in 30827ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30850ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35016 ms. Remains : 399/399 places, 1106/1106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 3 ms
Free SCC test removed 248 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 33 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:44:50] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:44:50] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:44:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:44:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:44:50] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:44:50] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 98 ms.
RANDOM walk for 25591 steps (6 resets) in 108 ms. (234 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 649176 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 649176 steps, saw 87505 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2024-06-01 13:44:53] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2024-06-01 13:44:53] [INFO ] Computed 20 invariants in 10 ms
[2024-06-01 13:44:53] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 766 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:55] [INFO ] Deduced a trap composed of 11 places in 552 ms of which 7 ms to minimize.
[2024-06-01 13:44:56] [INFO ] Deduced a trap composed of 20 places in 486 ms of which 6 ms to minimize.
[2024-06-01 13:44:56] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 6 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 52 places in 407 ms of which 5 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 5 ms to minimize.
[2024-06-01 13:44:58] [INFO ] Deduced a trap composed of 15 places in 422 ms of which 5 ms to minimize.
[2024-06-01 13:44:58] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 4 ms to minimize.
[2024-06-01 13:44:59] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 8/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1295 variables, 234/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1295 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1295 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4628 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 24 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 711208 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 711208 steps, saw 92981 distinct states, run finished after 3004 ms. (steps per millisecond=236 ) properties seen :0
[2024-06-01 13:45:02] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:45:02] [INFO ] Invariant cache hit.
[2024-06-01 13:45:02] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 44 places in 520 ms of which 6 ms to minimize.
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 27 places in 557 ms of which 7 ms to minimize.
[2024-06-01 13:45:05] [INFO ] Deduced a trap composed of 12 places in 547 ms of which 7 ms to minimize.
[2024-06-01 13:45:05] [INFO ] Deduced a trap composed of 18 places in 549 ms of which 6 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 7 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 10 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 22 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 14 places in 402 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 10/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1295 variables, 234/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1295 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1295 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5916 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 6667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 23 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 23 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:45:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:45:09] [INFO ] Invariant cache hit.
[2024-06-01 13:45:09] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-06-01 13:45:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:45:09] [INFO ] Invariant cache hit.
[2024-06-01 13:45:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 13:45:12] [INFO ] Implicit Places using invariants and state equation in 2985 ms returned []
Implicit Place search using SMT with State Equation took 3806 ms to find 0 implicit places.
[2024-06-01 13:45:12] [INFO ] Redundant transitions in 18 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 13:45:13] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:45:13] [INFO ] Invariant cache hit.
[2024-06-01 13:45:13] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:45:28] [INFO ] Deduced a trap composed of 50 places in 503 ms of which 6 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 10 places in 515 ms of which 6 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 19 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 64 places in 435 ms of which 6 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 5 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 29 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 58 places in 388 ms of which 5 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 81 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 5 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 62 places in 447 ms of which 6 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 6 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 55 places in 380 ms of which 5 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 5 ms to minimize.
[2024-06-01 13:45:35] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:45:35] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 5 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 5 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 13:45:37] [INFO ] Deduced a trap composed of 51 places in 465 ms of which 6 ms to minimize.
[2024-06-01 13:45:38] [INFO ] Deduced a trap composed of 64 places in 482 ms of which 5 ms to minimize.
[2024-06-01 13:45:38] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 6 ms to minimize.
[2024-06-01 13:45:39] [INFO ] Deduced a trap composed of 18 places in 457 ms of which 6 ms to minimize.
[2024-06-01 13:45:39] [INFO ] Deduced a trap composed of 27 places in 476 ms of which 5 ms to minimize.
[2024-06-01 13:45:40] [INFO ] Deduced a trap composed of 21 places in 490 ms of which 6 ms to minimize.
[2024-06-01 13:45:40] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 6 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 19 places in 471 ms of which 6 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 45 places in 462 ms of which 5 ms to minimize.
[2024-06-01 13:45:42] [INFO ] Deduced a trap composed of 46 places in 466 ms of which 6 ms to minimize.
[2024-06-01 13:45:42] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 6 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 5 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 5 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 51 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 30813ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34687 ms. Remains : 399/399 places, 1106/1106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 4 ms
Free SCC test removed 248 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 33 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:45:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:45:43] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:45:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:45:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:45:43] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:45:43] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
RANDOM walk for 30614 steps (6 resets) in 118 ms. (257 steps per ms) remains 0/1 properties
RANDOM walk for 30102 steps (6 resets) in 114 ms. (261 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727296 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727296 steps, saw 98713 distinct states, run finished after 3004 ms. (steps per millisecond=242 ) properties seen :0
[2024-06-01 13:45:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2024-06-01 13:45:47] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 13:45:47] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 28 places in 524 ms of which 6 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 18 places in 515 ms of which 6 ms to minimize.
[2024-06-01 13:45:50] [INFO ] Deduced a trap composed of 42 places in 513 ms of which 6 ms to minimize.
[2024-06-01 13:45:50] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 6 ms to minimize.
[2024-06-01 13:45:50] [INFO ] Deduced a trap composed of 48 places in 505 ms of which 6 ms to minimize.
[2024-06-01 13:45:51] [INFO ] Deduced a trap composed of 10 places in 514 ms of which 6 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 6 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 32 places in 517 ms of which 6 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 11 places in 516 ms of which 6 ms to minimize.
SMT process timed out in 6022ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 738000 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 738000 steps, saw 99745 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2024-06-01 13:45:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:45:56] [INFO ] Invariant cache hit.
[2024-06-01 13:45:56] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1103 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1103 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1295 variables, 234/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1295 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/179 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/437 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 42/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/869 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 72/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 318/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1097 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 228/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 14 places in 546 ms of which 6 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 6 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 11 places in 505 ms of which 6 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 53 places in 482 ms of which 6 ms to minimize.
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 18 places in 455 ms of which 6 ms to minimize.
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 6 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 10 places in 473 ms of which 5 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 20 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 53 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 10/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1097 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1103 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1103 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 5 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 6 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 6 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 6 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 6 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 69 places in 439 ms of which 5 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 41 places in 350 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 11/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1103 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 192/1295 variables, 234/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:46:08] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1295 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1295 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1295 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11350 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 399/399 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 12044ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-06-01 13:46:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:46:08] [INFO ] Invariant cache hit.
[2024-06-01 13:46:09] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-06-01 13:46:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 13:46:09] [INFO ] Invariant cache hit.
[2024-06-01 13:46:09] [INFO ] State equation strengthened by 330 read => feed constraints.

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-6"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-6, 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 r514-smll-171654416900177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 ;