Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r154-tall-174876825600397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Peterson-PT-7, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 196K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 781K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 870K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 110K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 318K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 157K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 553K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 714K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.8M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 904K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 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 1748846613222

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:43:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 06:43:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:43:34] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-06-02 06:43:34] [INFO ] Transformed 1992 places.
[2025-06-02 06:43:34] [INFO ] Transformed 3096 transitions.
[2025-06-02 06:43:34] [INFO ] Found NUPN structural information;
[2025-06-02 06:43:34] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 289 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 6 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 261 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2025-06-02 06:43:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2025-06-02 06:43:35] [INFO ] Computed 31 invariants in 34 ms
[2025-06-02 06:43:35] [INFO ] Implicit Places using invariants in 693 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 721 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 10 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1010 ms. Remains : 584/1992 places, 1696/3096 transitions.
Discarding 8 transitions out of 1696. Remains 1688
RANDOM walk for 40000 steps (8 resets) in 3840 ms. (10 steps per ms) remains 776/1688 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 776/776 properties
[2025-06-02 06:43:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 06:43:37] [INFO ] Computed 23 invariants in 5 ms
[2025-06-02 06:43:37] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 501/501 constraints. Problems are: Problem set: 0 solved, 776 unsolved
SMT process timed out in 5376ms, After SMT, problems are : Problem set: 0 solved, 776 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 501 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 53 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 3692490 steps (8 resets) in 120004 ms. (30 steps per ms) remains 672/776 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 672/672 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 672/672 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 672/672 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 670/672 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 669/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 669/669 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 666/669 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 664/666 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 662/664 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 656/662 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 654/656 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 651/654 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 650/651 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 648/650 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 648/648 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 648/648 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 648/648 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 648/648 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 647/648 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 646/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 645/646 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 643/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 643/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 640/643 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 640/640 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 640/640 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 639/640 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 638/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 638/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 637/638 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 635/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 634/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 634/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 632/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 630/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 630/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 628/630 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 628/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 625/628 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 623/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 622/623 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 621/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 619/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 618/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 618/618 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 618/618 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 617/618 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 616/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 616/616 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 616/616 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 616/616 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 616/616 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 615/616 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 614/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 613/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
[2025-06-02 06:44:13] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:44:13] [INFO ] Invariant cache hit.
[2025-06-02 06:44:13] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 420/420 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 3 (OVERLAPS) 164/584 variables, 16/443 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 164/607 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:44:27] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 31 ms to minimize.
[2025-06-02 06:44:28] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 4 ms to minimize.
[2025-06-02 06:44:28] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2025-06-02 06:44:28] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 4 ms to minimize.
[2025-06-02 06:44:28] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 4 ms to minimize.
[2025-06-02 06:44:29] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:44:29] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:44:29] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 4 ms to minimize.
[2025-06-02 06:44:29] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:44:30] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 3 ms to minimize.
[2025-06-02 06:44:30] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:44:30] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:44:30] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:44:30] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 3 ms to minimize.
[2025-06-02 06:44:31] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:44:31] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:44:31] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:44:31] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 4 ms to minimize.
[2025-06-02 06:44:32] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:44:32] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:44:33] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:44:33] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 4 ms to minimize.
[2025-06-02 06:44:33] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:44:33] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 4 ms to minimize.
[2025-06-02 06:44:33] [INFO ] Deduced a trap composed of 129 places in 221 ms of which 4 ms to minimize.
[2025-06-02 06:44:34] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:44:34] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 3 ms to minimize.
[2025-06-02 06:44:34] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:44:34] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:44:35] [INFO ] Deduced a trap composed of 124 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:44:35] [INFO ] Deduced a trap composed of 124 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:44:35] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:44:35] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:44:36] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:44:36] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 4 ms to minimize.
[2025-06-02 06:44:36] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:44:36] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:44:37] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:44:37] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:44:37] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:44:43] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:44:43] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:44:43] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:44:44] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 4 ms to minimize.
[2025-06-02 06:44:44] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:44:44] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:44:44] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:44:47] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 7 ms to minimize.
[2025-06-02 06:44:47] [INFO ] Deduced a trap composed of 95 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:44:47] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:44:47] [INFO ] Deduced a trap composed of 99 places in 207 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 4 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:44:51] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:44:51] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 2 ms to minimize.
[2025-06-02 06:44:51] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:44:51] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:44:51] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:44:52] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:44:52] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:44:52] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 5 ms to minimize.
[2025-06-02 06:44:52] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:44:53] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:44:54] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:44:54] [INFO ] Deduced a trap composed of 94 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:44:54] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 2 ms to minimize.
[2025-06-02 06:44:54] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:44:54] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:44:55] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:44:55] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:44:55] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:44:55] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:44:56] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:44:56] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:44:56] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:44:56] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:44:56] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:44:57] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:44:57] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:44:57] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 2 ms to minimize.
[2025-06-02 06:44:57] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:44:58] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 707 constraints, problems are : Problem set: 0 solved, 611 unsolved in 45028 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 611/611 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 611 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 420/420 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 3 (OVERLAPS) 164/584 variables, 16/443 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 164/607 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 100/707 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:04] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:45:05] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:45:05] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
[2025-06-02 06:45:05] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:45:06] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:45:06] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:45:06] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:45:06] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:45:06] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:45:07] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:45:07] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 2 ms to minimize.
[2025-06-02 06:45:07] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:45:07] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 2 ms to minimize.
[2025-06-02 06:45:09] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:45:09] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 4 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 2 ms to minimize.
[2025-06-02 06:45:14] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:45:14] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:45:14] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 3 ms to minimize.
[2025-06-02 06:45:14] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:45:14] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:45:15] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:45:15] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:45:15] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:45:15] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:17] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:45:17] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:45:18] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 4 ms to minimize.
[2025-06-02 06:45:18] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:45:18] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:45:19] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:45:19] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:45:19] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:45:20] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2025-06-02 06:45:21] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 20/767 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:24] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:45:24] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:45:25] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:45:25] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:45:25] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:45:25] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 2 ms to minimize.
[2025-06-02 06:45:26] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:45:26] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:45:26] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2025-06-02 06:45:26] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:45:27] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 2 ms to minimize.
[2025-06-02 06:45:27] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:45:27] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:45:27] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:45:27] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:45:28] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:45:28] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:45:28] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:45:28] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:45:28] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 20/787 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:31] [INFO ] Deduced a trap composed of 101 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:45:32] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:45:32] [INFO ] Deduced a trap composed of 96 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:45:32] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 20/807 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2025-06-02 06:45:40] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:45:41] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:45:42] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:45:42] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:45:42] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:45:42] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:45:43] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 2 ms to minimize.
[2025-06-02 06:45:43] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:45:43] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:45:44] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 817 constraints, problems are : Problem set: 0 solved, 611 unsolved in 45021 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/611 constraints, Known Traps: 210/210 constraints]
After SMT, in 90234ms problems are : Problem set: 0 solved, 611 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 420 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 4000000 steps (8 resets) in 105358 ms. (37 steps per ms) remains 602/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 601/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 601/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 599/601 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 11140 ms. (steps per millisecond=89 ) properties seen :0
[2025-06-02 06:46:22] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:46:22] [INFO ] Invariant cache hit.
[2025-06-02 06:46:22] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 4 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 3 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 3 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 4 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 4 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 4 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 4 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 4 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 4 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 3 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 4 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 4 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:46:41] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 4 ms to minimize.
[2025-06-02 06:46:41] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:46:41] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:46:41] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 3 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 4 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 4 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:46:50] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:46:50] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:46:51] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:46:51] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:46:51] [INFO ] Deduced a trap composed of 104 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:46:51] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 5 ms to minimize.
[2025-06-02 06:46:52] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 3 ms to minimize.
[2025-06-02 06:46:52] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:46:52] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:46:52] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:46:53] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:46:53] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:46:53] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:46:53] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:46:54] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 4 ms to minimize.
[2025-06-02 06:46:54] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:46:54] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 3 ms to minimize.
[2025-06-02 06:46:54] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:46:54] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:46:55] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:46:55] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:46:56] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:46:56] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:46:56] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:46:56] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:46:57] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:46:57] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2025-06-02 06:46:57] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:46:57] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:46:57] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 2 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 2 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 3 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 3 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 3 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 4 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1944 variables, and 765 constraints, problems are : Problem set: 0 solved, 597 unsolved in 75037 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 160/765 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 1 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 2 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:48:00] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 2 ms to minimize.
[2025-06-02 06:48:00] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:48:00] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:48:00] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/805 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:48:11] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:11] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:48:11] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:48:11] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:48:11] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/825 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2025-06-02 06:48:20] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 2 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 2 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2025-06-02 06:48:25] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/845 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:48:38] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:48:39] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:48:40] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1944 variables, and 865 constraints, problems are : Problem set: 0 solved, 597 unsolved in 75017 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/597 constraints, Known Traps: 260/260 constraints]
After SMT, in 150256ms problems are : Problem set: 0 solved, 597 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 411 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 41 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 3955282 steps (8 resets) in 116959 ms. (33 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 597/597 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 12350 ms. (steps per millisecond=80 ) properties seen :0
[2025-06-02 06:49:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:49:35] [INFO ] Invariant cache hit.
[2025-06-02 06:49:35] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:49:48] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 4 ms to minimize.
[2025-06-02 06:49:49] [INFO ] Deduced a trap composed of 74 places in 236 ms of which 4 ms to minimize.
[2025-06-02 06:49:49] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:49:49] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 4 ms to minimize.
[2025-06-02 06:49:49] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:49:50] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 3 ms to minimize.
[2025-06-02 06:49:50] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 4 ms to minimize.
[2025-06-02 06:49:50] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2025-06-02 06:49:50] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:49:51] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:49:51] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:49:51] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 4 ms to minimize.
[2025-06-02 06:49:51] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:49:52] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:49:52] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:49:52] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
[2025-06-02 06:49:52] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:49:53] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2025-06-02 06:49:53] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 3 ms to minimize.
[2025-06-02 06:49:53] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:49:54] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:49:54] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:49:54] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:49:54] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:49:54] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:49:56] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:49:56] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:49:56] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:49:56] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:49:57] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 4 ms to minimize.
[2025-06-02 06:49:57] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:49:57] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 4 ms to minimize.
[2025-06-02 06:49:57] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:49:58] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:49:58] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:49:58] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:03] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 6 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 4 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 70 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:50:05] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:50:05] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:50:05] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:50:05] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:50:06] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2025-06-02 06:50:06] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 2 ms to minimize.
[2025-06-02 06:50:06] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:50:06] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:50:06] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:50:07] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:50:07] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:50:07] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:50:07] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:50:08] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:50:08] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:09] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:50:09] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:50:09] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:50:09] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:50:09] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 5 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:50:10] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:50:11] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:50:11] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:50:11] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:50:11] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:50:11] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:50:12] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:50:12] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:50:12] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:50:12] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:50:13] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:14] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:50:14] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:50:14] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:50:14] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:50:15] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:50:15] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:50:15] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:50:15] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:50:16] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:50:16] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:50:16] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:50:17] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:50:17] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:50:17] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:50:17] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:50:17] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:50:18] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:50:18] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:50:18] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:50:18] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:25] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:50:25] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2025-06-02 06:50:25] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:50:26] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:50:26] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:50:26] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:50:26] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 2 ms to minimize.
[2025-06-02 06:50:26] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2025-06-02 06:50:27] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:50:27] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:50:27] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:50:27] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:50:28] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:50:28] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:50:28] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:50:28] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:50:29] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:50:29] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:50:29] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:50:29] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:31] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:50:31] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:50:31] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:50:32] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2025-06-02 06:50:32] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 3 ms to minimize.
[2025-06-02 06:50:32] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:50:32] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:50:33] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:50:33] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:50:33] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2025-06-02 06:50:33] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:50:34] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:50:34] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2025-06-02 06:50:34] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:50:34] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:50:34] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:50:35] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:50:35] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:50:35] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:50:35] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:38] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:50:38] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:50:38] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:50:39] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:50:39] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:50:39] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:50:39] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:50:39] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:50:40] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:50:40] [INFO ] Deduced a trap composed of 81 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:50:40] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:50:40] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:50:41] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:50:41] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:50:41] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:50:41] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:50:41] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:50:42] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:50:42] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
[2025-06-02 06:50:42] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:50:51] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:50:52] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:50:52] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:50:52] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:50:53] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 3 ms to minimize.
[2025-06-02 06:50:53] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 1 ms to minimize.
[2025-06-02 06:50:53] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2025-06-02 06:50:53] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:50:54] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:50:54] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:50:54] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:50:54] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 1 ms to minimize.
[2025-06-02 06:50:55] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 1 ms to minimize.
[2025-06-02 06:50:56] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:50:56] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:51:01] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:51:01] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:51:01] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:51:02] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:51:03] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:51:03] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:51:03] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:51:03] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:51:03] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:51:04] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:51:04] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:51:04] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:51:04] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2025-06-02 06:51:04] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 20/805 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1944 variables, and 805 constraints, problems are : Problem set: 0 solved, 597 unsolved in 90029 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 200/200 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 200/805 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:51:15] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2025-06-02 06:51:15] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:51:15] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:51:16] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:51:16] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 2 ms to minimize.
[2025-06-02 06:51:16] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:51:17] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:51:17] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:51:17] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:51:18] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:51:18] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:51:18] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:51:18] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:51:19] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:51:19] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 2 ms to minimize.
[2025-06-02 06:51:20] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:51:20] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:51:20] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:51:21] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:51:21] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/825 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:51:31] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2025-06-02 06:51:31] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:51:32] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:51:32] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:51:32] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 3 ms to minimize.
[2025-06-02 06:51:32] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:51:33] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2025-06-02 06:51:34] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:51:35] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 2 ms to minimize.
[2025-06-02 06:51:35] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2025-06-02 06:51:36] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:51:36] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:51:36] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 2 ms to minimize.
[2025-06-02 06:51:36] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:51:37] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:51:37] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:51:38] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:51:38] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:51:38] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:51:38] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/845 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:51:49] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:51:49] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:51:50] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:51:50] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:51:50] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 4 ms to minimize.
[2025-06-02 06:51:50] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:51:51] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:51:52] [INFO ] Deduced a trap composed of 122 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:51:52] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:51:52] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:51:53] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:51:54] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:51:54] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:51:54] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:52:31] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 5 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
SMT process timed out in 180370ms, After SMT, problems are : Problem set: 0 solved, 597 unsolved
Fused 597 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 411 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 25 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 06:52:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:52:35] [INFO ] Invariant cache hit.
[2025-06-02 06:52:36] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-02 06:52:36] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:52:36] [INFO ] Invariant cache hit.
[2025-06-02 06:52:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 06:52:37] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2025-06-02 06:52:37] [INFO ] Redundant transitions in 126 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 06:52:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:52:37] [INFO ] Invariant cache hit.
[2025-06-02 06:52:37] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:52:53] [INFO ] Deduced a trap composed of 78 places in 290 ms of which 4 ms to minimize.
[2025-06-02 06:52:53] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 4 ms to minimize.
[2025-06-02 06:52:53] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2025-06-02 06:52:54] [INFO ] Deduced a trap composed of 35 places in 417 ms of which 6 ms to minimize.
[2025-06-02 06:52:54] [INFO ] Deduced a trap composed of 47 places in 335 ms of which 7 ms to minimize.
[2025-06-02 06:52:54] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 7 ms to minimize.
[2025-06-02 06:52:55] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 4 ms to minimize.
[2025-06-02 06:52:55] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 4 ms to minimize.
[2025-06-02 06:52:55] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:52:55] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 4 ms to minimize.
[2025-06-02 06:52:56] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:52:56] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:52:56] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:52:56] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 2 ms to minimize.
[2025-06-02 06:52:57] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:52:57] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
[2025-06-02 06:52:57] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 3 ms to minimize.
[2025-06-02 06:52:57] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:52:58] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:52:58] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:52:59] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:52:59] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 6 ms to minimize.
[2025-06-02 06:52:59] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 3 ms to minimize.
[2025-06-02 06:52:59] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 3 ms to minimize.
[2025-06-02 06:53:00] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
[2025-06-02 06:53:00] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 3 ms to minimize.
[2025-06-02 06:53:00] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:53:00] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 4 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 3 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 3 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 4 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 3 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 3 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 4 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 3 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30030 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:09] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2025-06-02 06:53:10] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:53:10] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-06-02 06:53:10] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:53:10] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:53:11] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 96 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:53:17] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:53:17] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:53:17] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:53:17] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:53:17] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:53:18] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:53:18] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:19] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 3 ms to minimize.
[2025-06-02 06:53:19] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:53:19] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:53:19] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 2 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:53:20] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:53:21] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:53:21] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:53:21] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:53:21] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:53:21] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 2 ms to minimize.
[2025-06-02 06:53:22] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:53:22] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:53:22] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:53:22] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:53:22] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:23] [INFO ] Deduced a trap composed of 58 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:53:24] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2025-06-02 06:53:24] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:53:24] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:53:24] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:53:25] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:53:26] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:53:26] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:53:26] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:53:26] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:53:26] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:53:27] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:53:27] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 6 ms to minimize.
[2025-06-02 06:53:27] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:53:27] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:28] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 4 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 06:53:34] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 4 ms to minimize.
[2025-06-02 06:53:34] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:53:35] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:53:35] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:53:35] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:53:35] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:53:36] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:53:36] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:53:37] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:53:37] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:53:37] [INFO ] Deduced a trap composed of 56 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:53:37] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:53:37] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:53:38] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:53:38] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 60857ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62489 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 400000 steps (8 resets) in 8367 ms. (47 steps per ms) remains 270/411 properties
Running SMT prover for 270 properties.
[2025-06-02 06:53:40] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:53:40] [INFO ] Invariant cache hit.
[2025-06-02 06:53:40] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 06:53:41] [INFO ] After 638ms SMT Verify possible using state equation in real domain returned unsat :0 sat :270
[2025-06-02 06:53:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 06:53:43] [INFO ] After 1468ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :270
TRAPS : Iteration 0
[2025-06-02 06:54:02] [INFO ] After 20842ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:270
[2025-06-02 06:54:02] [INFO ] After 21760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:270
[2025-06-02 06:54:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 06:54:03] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :270
[2025-06-02 06:54:05] [INFO ] After 1826ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :270
TRAPS : Iteration 0
[2025-06-02 06:54:05] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 3 ms to minimize.
[2025-06-02 06:54:05] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 3 ms to minimize.
[2025-06-02 06:54:06] [INFO ] Deduced a trap composed of 11 places in 426 ms of which 4 ms to minimize.
[2025-06-02 06:54:06] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 11 ms to minimize.
[2025-06-02 06:54:07] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 3 ms to minimize.
[2025-06-02 06:54:07] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 3 ms to minimize.
[2025-06-02 06:54:07] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:54:07] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 3 ms to minimize.
[2025-06-02 06:54:08] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 3 ms to minimize.
[2025-06-02 06:54:08] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:54:08] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 3 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 4 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 74 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 4 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:54:14] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:54:14] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:54:14] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:54:14] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:54:15] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:54:15] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 2 ms to minimize.
[2025-06-02 06:54:15] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:54:15] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:54:15] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:54:16] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:54:16] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:54:16] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2025-06-02 06:54:16] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:54:17] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:54:17] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:54:17] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:54:17] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
[2025-06-02 06:54:18] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:54:18] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12886 ms
[2025-06-02 06:54:18] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:54:18] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:54:18] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2025-06-02 06:54:19] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:54:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 898 ms
[2025-06-02 06:54:19] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:54:19] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:54:19] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:54:19] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:54:20] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:54:20] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:54:20] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:54:20] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:54:21] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:54:21] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:54:21] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 2 ms to minimize.
[2025-06-02 06:54:22] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:54:22] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:54:22] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:54:22] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:54:23] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 4 ms to minimize.
[2025-06-02 06:54:23] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 4 ms to minimize.
[2025-06-02 06:54:23] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
[2025-06-02 06:54:23] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2025-06-02 06:54:24] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:54:24] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:54:24] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:54:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5448 ms
[2025-06-02 06:54:24] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:54:25] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:54:25] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:54:25] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:54:25] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:54:26] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 4 ms to minimize.
[2025-06-02 06:54:26] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:54:26] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:54:26] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:54:27] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:54:27] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:54:27] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:54:28] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:54:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3464 ms
[2025-06-02 06:54:28] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2025-06-02 06:54:28] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:54:28] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:54:29] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:54:29] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:54:29] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:54:29] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:54:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1412 ms
[2025-06-02 06:54:30] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:54:30] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:54:30] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 3 ms to minimize.
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2803 ms
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 2 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:54:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4784 ms
[2025-06-02 06:54:38] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:54:38] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:54:38] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:54:38] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:54:39] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:54:39] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:54:39] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 4 ms to minimize.
[2025-06-02 06:54:40] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:54:40] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:54:40] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:54:40] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:54:40] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:54:41] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 4 ms to minimize.
[2025-06-02 06:54:41] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:54:41] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:54:41] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2025-06-02 06:54:42] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:54:42] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:54:42] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:54:42] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 3 ms to minimize.
[2025-06-02 06:54:43] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:54:43] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:54:43] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:54:43] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:54:43] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 1 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:54:44] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:54:45] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:54:45] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7149 ms
[2025-06-02 06:54:45] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:54:45] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:54:45] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:54:45] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:54:46] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:54:47] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:54:47] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:54:47] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:54:48] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:54:48] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:54:48] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:54:49] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:54:49] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:54:49] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:54:49] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:54:50] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:54:50] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:54:50] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:54:50] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:54:50] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:54:51] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:54:51] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:54:51] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:54:51] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:54:51] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:54:52] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:54:52] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6810 ms
[2025-06-02 06:54:52] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:54:52] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:54:52] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:54:52] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:54:53] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:54:53] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:54:53] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 3 ms to minimize.
[2025-06-02 06:54:53] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:54:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2830 ms
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2025-06-02 06:54:56] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:54:56] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 2 ms to minimize.
[2025-06-02 06:54:57] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:54:57] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 2 ms to minimize.
[2025-06-02 06:54:57] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:55:00] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:55:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4221 ms
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:55:04] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:55:04] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:55:04] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:55:04] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:55:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5127 ms
[2025-06-02 06:55:06] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:55:06] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:55:06] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:55:07] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:55:07] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2025-06-02 06:55:07] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:55:07] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:55:07] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:55:08] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:55:08] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2025-06-02 06:55:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2368 ms
[2025-06-02 06:55:08] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:55:08] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:55:09] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:55:09] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:55:09] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:55:09] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:55:10] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:55:10] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:55:10] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:55:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2041 ms
[2025-06-02 06:55:10] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:55:11] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:55:11] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:55:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 832 ms
[2025-06-02 06:55:11] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:55:12] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:55:12] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:55:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 820 ms
[2025-06-02 06:55:12] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:55:13] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:55:13] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:55:13] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2025-06-02 06:55:13] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:55:14] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:55:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1377 ms
[2025-06-02 06:55:14] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:55:14] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 90 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:55:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2586 ms
[2025-06-02 06:55:17] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2025-06-02 06:55:17] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:55:17] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:55:18] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:55:18] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:55:18] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:55:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1340 ms
[2025-06-02 06:55:19] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2025-06-02 06:55:19] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:55:21] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:55:21] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 2 ms to minimize.
[2025-06-02 06:55:21] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:55:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2047 ms
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:55:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:55:23] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2025-06-02 06:55:23] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:55:24] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:55:24] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:55:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 678 ms
[2025-06-02 06:55:24] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2025-06-02 06:55:25] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2025-06-02 06:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2025-06-02 06:55:25] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:55:25] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:55:26] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:55:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 667 ms
[2025-06-02 06:55:26] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2025-06-02 06:55:27] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:55:27] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 4 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 2 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 4 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:55:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5590 ms
[2025-06-02 06:55:32] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
[2025-06-02 06:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2025-06-02 06:55:32] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2025-06-02 06:55:33] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:55:33] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:55:33] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:55:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2025-06-02 06:55:33] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2025-06-02 06:55:34] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:55:34] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:55:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
[2025-06-02 06:55:34] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2025-06-02 06:55:35] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:55:35] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:55:35] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:55:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 830 ms
[2025-06-02 06:55:36] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:55:36] [INFO ] Deduced a trap composed of 88 places in 224 ms of which 4 ms to minimize.
[2025-06-02 06:55:36] [INFO ] Deduced a trap composed of 88 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:55:38] [INFO ] Deduced a trap composed of 78 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:55:38] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 3 ms to minimize.
[2025-06-02 06:55:38] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:55:38] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:55:39] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:39] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 4 ms to minimize.
[2025-06-02 06:55:39] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:55:39] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3723 ms
[2025-06-02 06:55:40] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 2 ms to minimize.
[2025-06-02 06:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 06:55:40] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2025-06-02 06:55:40] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2025-06-02 06:55:41] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2025-06-02 06:55:41] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:55:41] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:55:42] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:55:42] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:55:42] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:55:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1149 ms
[2025-06-02 06:55:42] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
[2025-06-02 06:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2025-06-02 06:55:43] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2025-06-02 06:55:43] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:55:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1134 ms
[2025-06-02 06:55:45] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:55:45] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 3 ms to minimize.
[2025-06-02 06:55:45] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:55:45] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:55:46] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:55:46] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:55:46] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:55:46] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:55:47] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:55:47] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:55:47] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:55:47] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 2 ms to minimize.
[2025-06-02 06:55:48] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:48] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:55:48] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:55:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3522 ms
[2025-06-02 06:55:49] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2025-06-02 06:55:49] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:55:49] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:55:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 968 ms
[2025-06-02 06:55:51] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:55:52] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:55:52] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:55:52] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:55:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1132 ms
[2025-06-02 06:55:53] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:55:54] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:55:54] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:55:54] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:55:54] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:55:55] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:55:55] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:55:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1669 ms
[2025-06-02 06:55:55] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:55:55] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:55:55] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:55:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 769 ms
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:55:57] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:55:57] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2025-06-02 06:55:58] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:55:58] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:55:59] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:55:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2738 ms
[2025-06-02 06:55:59] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:55:59] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:55:59] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:55:59] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:56:00] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:56:00] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:56:00] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1356 ms
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 2 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 88 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1018 ms
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1301 ms
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 539 ms
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 4 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:56:07] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:56:07] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:56:07] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:56:07] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 3 ms to minimize.
[2025-06-02 06:56:08] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:56:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2081 ms
[2025-06-02 06:56:08] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:56:08] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:56:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 559 ms
[2025-06-02 06:56:09] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2025-06-02 06:56:09] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2025-06-02 06:56:11] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:56:12] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:56:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1655 ms
[2025-06-02 06:56:12] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1678 ms
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1428 ms
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2025-06-02 06:56:20] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:56:20] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1197 ms
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2025-06-02 06:56:24] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2025-06-02 06:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2025-06-02 06:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2025-06-02 06:56:26] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2025-06-02 06:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2025-06-02 06:56:27] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2025-06-02 06:56:27] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:56:27] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:56:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 859 ms
[2025-06-02 06:56:29] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 4 ms to minimize.
[2025-06-02 06:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2025-06-02 06:56:29] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:56:30] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:56:30] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
[2025-06-02 06:56:31] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:56:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1429 ms
[2025-06-02 06:56:32] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:56:33] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:56:33] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:56:33] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 726 ms
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2025-06-02 06:56:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 5 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 942 ms
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 109 places in 219 ms of which 4 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 835 ms
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 2 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1216 ms
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1811 ms
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
TRAPS : Iteration 1
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
TRAPS : Iteration 2
[2025-06-02 06:57:22] [INFO ] After 199196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :269
[2025-06-02 06:57:22] [INFO ] After 200027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :269
RANDOM walk for 1409940 steps (3 resets) in 120004 ms. (11 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/597 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 14271 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-02 06:58:07] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 06:58:07] [INFO ] Invariant cache hit.
[2025-06-02 06:58:07] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:20] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 4 ms to minimize.
[2025-06-02 06:58:21] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 3 ms to minimize.
[2025-06-02 06:58:21] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 3 ms to minimize.
[2025-06-02 06:58:21] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 4 ms to minimize.
[2025-06-02 06:58:21] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 3 ms to minimize.
[2025-06-02 06:58:22] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 4 ms to minimize.
[2025-06-02 06:58:22] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2025-06-02 06:58:22] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:58:22] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2025-06-02 06:58:23] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2025-06-02 06:58:23] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:58:23] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 3 ms to minimize.
[2025-06-02 06:58:23] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:58:24] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2025-06-02 06:58:24] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2025-06-02 06:58:24] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 3 ms to minimize.
[2025-06-02 06:58:24] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:58:25] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:58:25] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2025-06-02 06:58:25] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:26] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 4 ms to minimize.
[2025-06-02 06:58:26] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:58:26] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:58:26] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:58:28] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 4 ms to minimize.
[2025-06-02 06:58:28] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:58:28] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:58:28] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:58:29] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 4 ms to minimize.
[2025-06-02 06:58:29] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 4 ms to minimize.
[2025-06-02 06:58:29] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:58:29] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:58:30] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:58:30] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:58:30] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 3 ms to minimize.
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 3 ms to minimize.
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 104 places in 203 ms of which 3 ms to minimize.
[2025-06-02 06:58:37] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:58:37] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 06:58:37] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:58:37] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2025-06-02 06:58:38] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:58:38] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:58:38] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2025-06-02 06:58:38] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:58:39] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:58:39] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:58:39] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:58:39] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:58:39] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 2 ms to minimize.
[2025-06-02 06:58:40] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2025-06-02 06:58:40] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 3 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 3 ms to minimize.
[2025-06-02 06:58:42] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:58:42] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 3 ms to minimize.
[2025-06-02 06:58:42] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
[2025-06-02 06:58:42] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 3 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 3 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 3 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:58:43] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:58:44] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 3 ms to minimize.
[2025-06-02 06:58:44] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:58:44] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:58:44] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2025-06-02 06:58:45] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:46] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:58:46] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2025-06-02 06:58:46] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 2 ms to minimize.
[2025-06-02 06:58:46] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 2 ms to minimize.
[2025-06-02 06:58:47] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:58:47] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2025-06-02 06:58:47] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2025-06-02 06:58:47] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2025-06-02 06:58:48] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2025-06-02 06:58:48] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:58:48] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:58:49] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:58:49] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 2 ms to minimize.
[2025-06-02 06:58:49] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2025-06-02 06:58:49] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:58:49] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 3 ms to minimize.
[2025-06-02 06:58:50] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:58:50] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:58:50] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:58:50] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:58:57] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:58:57] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 2 ms to minimize.
[2025-06-02 06:58:59] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:58:59] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2025-06-02 06:58:59] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:58:59] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:59:00] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:59:00] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:59:00] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2025-06-02 06:59:00] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:59:01] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:59:01] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:59:01] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:59:01] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:59:01] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:59:03] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:59:03] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
[2025-06-02 06:59:04] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2025-06-02 06:59:04] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2025-06-02 06:59:04] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 3 ms to minimize.
[2025-06-02 06:59:04] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 4 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 3 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 3 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 3 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 2 ms to minimize.
[2025-06-02 06:59:07] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2025-06-02 06:59:07] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 3 ms to minimize.
[2025-06-02 06:59:07] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2025-06-02 06:59:08] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:59:10] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:59:10] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:59:10] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 3 ms to minimize.
[2025-06-02 06:59:11] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:59:11] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:59:11] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:59:11] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 3 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2025-06-02 06:59:13] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2025-06-02 06:59:13] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:59:13] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:59:13] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:59:14] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:59:14] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:59:14] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:59:14] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:59:23] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2025-06-02 06:59:23] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 3 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 3 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 2 ms to minimize.
[2025-06-02 06:59:26] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 3 ms to minimize.
[2025-06-02 06:59:26] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2025-06-02 06:59:26] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:59:26] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:59:32] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:59:33] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2025-06-02 06:59:36] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:59:36] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 20/805 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 06:59:41] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2025-06-02 06:59:42] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:59:43] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 3 ms to minimize.
[2025-06-02 06:59:43] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2025-06-02 06:59:43] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 2 ms to minimize.
[2025-06-02 06:59:43] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 2 ms to minimize.
[2025-06-02 06:59:44] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 3 ms to minimize.
[2025-06-02 06:59:44] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 2 ms to minimize.
[2025-06-02 06:59:44] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 2 ms to minimize.
[2025-06-02 06:59:44] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2025-06-02 06:59:44] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:59:45] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-02 06:59:45] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:59:45] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 20/825 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1944 variables, and 825 constraints, problems are : Problem set: 0 solved, 597 unsolved in 105028 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 411/411 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (OVERLAPS) 172/583 variables, 16/433 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 172/605 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 220/825 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 07:00:09] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:00:09] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:00:10] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:00:10] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:00:10] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:00:10] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:00:11] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 1 ms to minimize.
[2025-06-02 07:00:11] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:00:11] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:00:11] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:00:12] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:00:12] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2025-06-02 07:00:13] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2025-06-02 07:00:13] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 1 ms to minimize.
[2025-06-02 07:00:13] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2025-06-02 07:00:14] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2025-06-02 07:00:14] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2025-06-02 07:00:14] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2025-06-02 07:00:14] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-06-02 07:00:14] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/845 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 07:00:27] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:00:27] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:00:27] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:00:27] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:00:27] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:00:28] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:00:28] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:00:28] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:00:28] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:00:28] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:00:29] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:00:30] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 1 ms to minimize.
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:00:32] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2025-06-02 07:00:32] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 4 ms to minimize.
[2025-06-02 07:00:32] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 07:00:47] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 4 ms to minimize.
[2025-06-02 07:00:49] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 1 ms to minimize.
[2025-06-02 07:00:49] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:00:49] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 1 ms to minimize.
[2025-06-02 07:00:49] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2025-06-02 07:00:50] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 3 ms to minimize.
[2025-06-02 07:00:50] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2025-06-02 07:00:51] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:00:51] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:00:51] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2025-06-02 07:00:52] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2025-06-02 07:00:52] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:00:52] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:00:52] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2025-06-02 07:00:52] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2025-06-02 07:00:53] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 1 ms to minimize.
[2025-06-02 07:00:53] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2025-06-02 07:00:53] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2025-06-02 07:00:53] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2025-06-02 07:00:53] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 597 unsolved
[2025-06-02 07:01:16] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 4 ms to minimize.
[2025-06-02 07:01:16] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2025-06-02 07:01:17] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:01:17] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2025-06-02 07:01:17] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2025-06-02 07:01:18] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2025-06-02 07:01:18] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2025-06-02 07:01:19] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:01:19] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:01:20] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:01:20] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:01:20] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:01:21] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-02 07:01:21] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2025-06-02 07:01:22] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 1 ms to minimize.
[2025-06-02 07:01:22] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 1 ms to minimize.
[2025-06-02 07:01:23] [INFO ] Deduced a trap composed of 94 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:01:23] [INFO ] Deduced a trap composed of 94 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:01:23] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:01:24] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/905 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1944 variables, and 905 constraints, problems are : Problem set: 0 solved, 597 unsolved in 105019 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/597 constraints, Known Traps: 300/300 constraints]
After SMT, in 210190ms problems are : Problem set: 0 solved, 597 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 411 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:01:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:01:37] [INFO ] Invariant cache hit.
[2025-06-02 07:01:38] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-02 07:01:38] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:01:38] [INFO ] Invariant cache hit.
[2025-06-02 07:01:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:01:39] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2025-06-02 07:01:39] [INFO ] Redundant transitions in 90 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:01:39] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:01:39] [INFO ] Invariant cache hit.
[2025-06-02 07:01:39] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:01:54] [INFO ] Deduced a trap composed of 78 places in 293 ms of which 3 ms to minimize.
[2025-06-02 07:01:54] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 4 ms to minimize.
[2025-06-02 07:01:55] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2025-06-02 07:01:55] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 3 ms to minimize.
[2025-06-02 07:01:55] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2025-06-02 07:01:55] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2025-06-02 07:01:56] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 3 ms to minimize.
[2025-06-02 07:01:56] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:01:56] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:01:56] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:01:57] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:01:57] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2025-06-02 07:01:57] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 2 ms to minimize.
[2025-06-02 07:01:57] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:01:57] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:01:58] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:01:58] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:01:58] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:01:58] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:01:59] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:01:59] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 3 ms to minimize.
[2025-06-02 07:02:00] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 3 ms to minimize.
[2025-06-02 07:02:00] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2025-06-02 07:02:00] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 3 ms to minimize.
[2025-06-02 07:02:00] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 3 ms to minimize.
[2025-06-02 07:02:01] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:02:01] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 4 ms to minimize.
[2025-06-02 07:02:01] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 4 ms to minimize.
[2025-06-02 07:02:01] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:02:02] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:02:02] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 3 ms to minimize.
[2025-06-02 07:02:02] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:02:02] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:02:03] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:02:03] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 4 ms to minimize.
[2025-06-02 07:02:03] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:02:03] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:02:04] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:02:04] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 2 ms to minimize.
[2025-06-02 07:02:04] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30024 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:11] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:02:11] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 3 ms to minimize.
[2025-06-02 07:02:12] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:02:12] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:02:12] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:02:12] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:02:12] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:02:13] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:02:13] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:02:13] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:02:13] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:02:13] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:02:14] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:02:14] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:02:14] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:02:14] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:02:14] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:02:15] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 14 ms to minimize.
[2025-06-02 07:02:15] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
[2025-06-02 07:02:15] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:16] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:02:16] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:02:16] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:02:17] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:02:17] [INFO ] Deduced a trap composed of 96 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:02:17] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:02:17] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 2 ms to minimize.
[2025-06-02 07:02:17] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 2 ms to minimize.
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 2 ms to minimize.
[2025-06-02 07:02:19] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:02:19] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:02:19] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2025-06-02 07:02:19] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:02:19] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 2 ms to minimize.
[2025-06-02 07:02:20] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 2 ms to minimize.
[2025-06-02 07:02:20] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:21] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 4 ms to minimize.
[2025-06-02 07:02:21] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:02:21] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:02:21] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 2 ms to minimize.
[2025-06-02 07:02:22] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:02:22] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 5 ms to minimize.
[2025-06-02 07:02:22] [INFO ] Deduced a trap composed of 62 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:02:22] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2025-06-02 07:02:23] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 2 ms to minimize.
[2025-06-02 07:02:23] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:02:23] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:02:23] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 2 ms to minimize.
[2025-06-02 07:02:23] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 2 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2025-06-02 07:02:24] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:02:25] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:26] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:02:26] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 2 ms to minimize.
[2025-06-02 07:02:26] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:02:26] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:02:27] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:02:27] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:02:27] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 2 ms to minimize.
[2025-06-02 07:02:27] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:02:27] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:02:28] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:02:28] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:02:28] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:02:28] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:02:28] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 2 ms to minimize.
[2025-06-02 07:02:29] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:02:29] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:02:29] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:02:29] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:02:29] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:02:30] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:31] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:02:31] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:02:31] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:02:31] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2025-06-02 07:02:31] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:02:32] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 2 ms to minimize.
[2025-06-02 07:02:35] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:02:37] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:02:37] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2025-06-02 07:02:37] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:02:37] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:02:37] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:02:38] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:02:39] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:02:39] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:02:39] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2025-06-02 07:02:39] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:02:39] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:02:40] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 60813ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60829ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62365 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 400000 steps (8 resets) in 10105 ms. (39 steps per ms) remains 270/411 properties
Running SMT prover for 270 properties.
[2025-06-02 07:02:43] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:02:43] [INFO ] Invariant cache hit.
[2025-06-02 07:02:43] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2025-06-02 07:02:44] [INFO ] After 616ms SMT Verify possible using state equation in real domain returned unsat :0 sat :270
[2025-06-02 07:02:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:02:46] [INFO ] After 1482ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :270
TRAPS : Iteration 0
[2025-06-02 07:03:05] [INFO ] After 20790ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:270
[2025-06-02 07:03:05] [INFO ] After 21676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:270
[2025-06-02 07:03:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2025-06-02 07:03:06] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :270
[2025-06-02 07:03:08] [INFO ] After 1809ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :270
TRAPS : Iteration 0
[2025-06-02 07:03:08] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:03:08] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 3 ms to minimize.
[2025-06-02 07:03:08] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
[2025-06-02 07:03:09] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 3 ms to minimize.
[2025-06-02 07:03:09] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:03:09] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 4 ms to minimize.
[2025-06-02 07:03:10] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:03:10] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:03:10] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:03:10] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:03:11] [INFO ] Deduced a trap composed of 95 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:03:11] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:03:11] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:03:11] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:03:12] [INFO ] Deduced a trap composed of 73 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:03:12] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:03:12] [INFO ] Deduced a trap composed of 83 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:03:12] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:03:13] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 2 ms to minimize.
[2025-06-02 07:03:13] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:03:13] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:03:13] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:14] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:03:14] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 4 ms to minimize.
[2025-06-02 07:03:14] [INFO ] Deduced a trap composed of 80 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:03:14] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:03:15] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:03:15] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:03:15] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:03:15] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:03:15] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:03:16] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:16] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:03:16] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:03:16] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:03:17] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:03:17] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:03:17] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:03:17] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:03:18] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:03:18] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:03:18] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:03:18] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:03:18] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:03:19] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 2 ms to minimize.
[2025-06-02 07:03:19] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:03:19] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:03:19] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:03:20] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:20] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:03:20] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:03:20] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:03:22] [INFO ] Deduced a trap composed of 87 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:03:22] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 14140 ms
[2025-06-02 07:03:22] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:03:22] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:03:23] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 4 ms to minimize.
[2025-06-02 07:03:23] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:03:23] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:03:23] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2025-06-02 07:03:24] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:03:24] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:03:24] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:03:24] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:03:25] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:03:25] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:25] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:03:25] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:03:26] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:03:26] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:03:26] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:03:26] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:03:27] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:03:27] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:03:27] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:03:27] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:03:28] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:03:28] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:03:28] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:03:29] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 3 ms to minimize.
[2025-06-02 07:03:29] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:03:29] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:03:29] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 4 ms to minimize.
[2025-06-02 07:03:30] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:03:30] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 6 ms to minimize.
[2025-06-02 07:03:30] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:03:30] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:03:31] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:03:31] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:03:31] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:03:31] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:03:31] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 9450 ms
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2025-06-02 07:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 4 ms to minimize.
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:03:33] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:03:33] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:03:33] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:03:33] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:03:34] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:03:34] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 2 ms to minimize.
[2025-06-02 07:03:34] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:03:35] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:03:35] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:03:35] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 4 ms to minimize.
[2025-06-02 07:03:35] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:03:36] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:36] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:03:36] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 4 ms to minimize.
[2025-06-02 07:03:36] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:03:37] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 3 ms to minimize.
[2025-06-02 07:03:37] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 5 ms to minimize.
[2025-06-02 07:03:37] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:03:37] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:03:38] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:03:38] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5818 ms
[2025-06-02 07:03:38] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:03:38] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:03:38] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:03:39] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:03:39] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:03:39] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2025-06-02 07:03:39] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:03:40] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:03:40] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:03:40] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 2 ms to minimize.
[2025-06-02 07:03:40] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:03:41] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 2 ms to minimize.
[2025-06-02 07:03:41] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:03:41] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:03:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3374 ms
[2025-06-02 07:03:41] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:03:42] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:03:42] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:03:42] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:03:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 988 ms
[2025-06-02 07:03:42] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:03:43] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:03:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2025-06-02 07:03:43] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:03:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2025-06-02 07:03:43] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:03:44] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:03:44] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:03:44] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:03:44] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 3 ms to minimize.
[2025-06-02 07:03:45] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:03:45] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:03:45] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2025-06-02 07:03:45] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:03:45] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:03:46] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:03:46] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:03:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2507 ms
[2025-06-02 07:03:46] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:03:46] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2025-06-02 07:03:47] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 07:03:48] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2025-06-02 07:03:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3336 ms
[2025-06-02 07:03:49] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:03:50] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:03:50] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:03:50] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:03:50] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:03:50] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:03:51] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2025-06-02 07:03:52] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2025-06-02 07:03:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2447 ms
[2025-06-02 07:03:52] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-02 07:03:52] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:03:52] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:03:53] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:03:53] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:03:53] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:03:54] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:03:54] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:03:54] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:03:55] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:03:55] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:03:55] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:03:55] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:03:56] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:03:56] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:03:56] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:03:56] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:03:57] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:03:57] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:03:57] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:03:57] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:03:58] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:03:58] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:03:58] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:03:58] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:03:58] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2025-06-02 07:03:59] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:03:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7018 ms
[2025-06-02 07:03:59] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:03:59] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:03:59] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:04:00] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:04:00] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:04:00] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:04:00] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:04:01] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 3 ms to minimize.
[2025-06-02 07:04:01] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:04:01] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 2 ms to minimize.
[2025-06-02 07:04:01] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Deduced a trap composed of 68 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:04:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3675 ms
[2025-06-02 07:04:03] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2025-06-02 07:04:03] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2025-06-02 07:04:03] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2025-06-02 07:04:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 600 ms
[2025-06-02 07:04:04] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:04:04] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:04:05] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 2 ms to minimize.
[2025-06-02 07:04:05] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:04:05] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:04:05] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:04:06] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:04:06] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:04:06] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:06] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:04:07] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:04:07] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2025-06-02 07:04:07] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:04:07] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:04:08] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:04:08] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 2 ms to minimize.
[2025-06-02 07:04:08] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:04:08] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:04:09] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:04:09] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:04:09] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:04:09] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:04:10] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:10] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:04:10] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 3 ms to minimize.
[2025-06-02 07:04:10] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 3 ms to minimize.
[2025-06-02 07:04:11] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:04:11] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2025-06-02 07:04:11] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2025-06-02 07:04:11] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7091 ms
[2025-06-02 07:04:11] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:04:12] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:04:12] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:04:12] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:04:12] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2025-06-02 07:04:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1411 ms
[2025-06-02 07:04:13] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:04:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2025-06-02 07:04:13] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:04:14] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:04:14] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:04:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 796 ms
[2025-06-02 07:04:14] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2025-06-02 07:04:15] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2025-06-02 07:04:15] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:16] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 2 ms to minimize.
[2025-06-02 07:04:16] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:04:16] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:04:16] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:04:17] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:04:17] [INFO ] Deduced a trap composed of 96 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:04:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1700 ms
[2025-06-02 07:04:17] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:04:18] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:04:18] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:04:18] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:04:18] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:04:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1566 ms
[2025-06-02 07:04:19] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:04:19] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:04:20] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:04:20] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:04:20] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:04:20] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:21] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:04:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1787 ms
[2025-06-02 07:04:21] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:04:21] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:04:21] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:22] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2025-06-02 07:04:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1012 ms
[2025-06-02 07:04:22] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:04:22] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:04:23] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 2 ms to minimize.
[2025-06-02 07:04:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 863 ms
[2025-06-02 07:04:23] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:04:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2025-06-02 07:04:23] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:04:24] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:04:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2025-06-02 07:04:24] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2025-06-02 07:04:25] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:04:25] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:04:25] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:04:25] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:04:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 999 ms
[2025-06-02 07:04:26] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2025-06-02 07:04:26] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:04:26] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:04:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2025-06-02 07:04:27] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2025-06-02 07:04:27] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2025-06-02 07:04:27] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2025-06-02 07:04:27] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2025-06-02 07:04:28] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:04:28] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:04:29] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:04:29] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:04:29] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:04:29] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:04:29] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:04:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3451 ms
[2025-06-02 07:04:31] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2025-06-02 07:04:31] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2025-06-02 07:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1096 ms
[2025-06-02 07:04:32] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-06-02 07:04:32] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2025-06-02 07:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2025-06-02 07:04:33] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 07:04:33] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 07:04:33] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2025-06-02 07:04:34] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:04:34] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:04:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2025-06-02 07:04:35] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:04:35] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:04:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2025-06-02 07:04:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 825 ms
[2025-06-02 07:04:36] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 2 ms to minimize.
[2025-06-02 07:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2025-06-02 07:04:36] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2025-06-02 07:04:36] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2025-06-02 07:04:37] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:04:37] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:04:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 814 ms
[2025-06-02 07:04:37] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2025-06-02 07:04:38] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:04:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2025-06-02 07:04:38] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:04:38] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:04:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2025-06-02 07:04:39] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2025-06-02 07:04:39] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2025-06-02 07:04:39] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:04:40] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:04:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2025-06-02 07:04:40] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 2 ms to minimize.
[2025-06-02 07:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2025-06-02 07:04:40] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:04:41] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:04:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2025-06-02 07:04:41] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:04:41] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:04:41] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2025-06-02 07:04:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 774 ms
[2025-06-02 07:04:42] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:04:42] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:04:42] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:04:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 720 ms
[2025-06-02 07:04:42] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:04:43] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
[2025-06-02 07:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2025-06-02 07:04:44] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:04:44] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:04:44] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:04:45] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:04:45] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:04:47] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:04:47] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 2 ms to minimize.
[2025-06-02 07:04:47] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:04:47] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:04:48] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:04:48] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:04:48] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:04:48] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:04:48] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:04:49] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:04:49] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:04:49] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:04:49] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:04:50] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6748 ms
[2025-06-02 07:04:51] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:04:51] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:04:51] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2025-06-02 07:04:51] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:04:51] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:04:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1157 ms
[2025-06-02 07:04:53] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2025-06-02 07:04:54] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:04:54] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2025-06-02 07:04:54] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:04:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2025-06-02 07:04:54] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:04:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2025-06-02 07:04:56] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:04:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 831 ms
[2025-06-02 07:04:57] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-06-02 07:04:57] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:04:57] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:04:57] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:04:58] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 2 ms to minimize.
[2025-06-02 07:04:58] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:04:58] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 13 ms to minimize.
[2025-06-02 07:04:58] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:04:59] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:04:59] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:04:59] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:05:00] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:05:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2834 ms
[2025-06-02 07:05:00] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:05:00] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:05:00] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:05:00] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
[2025-06-02 07:05:01] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:05:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1111 ms
[2025-06-02 07:05:02] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2025-06-02 07:05:02] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-02 07:05:02] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2025-06-02 07:05:02] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2025-06-02 07:05:03] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2025-06-02 07:05:03] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2025-06-02 07:05:03] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2025-06-02 07:05:03] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2025-06-02 07:05:03] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2025-06-02 07:05:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2796 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:05:06] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 3 ms to minimize.
[2025-06-02 07:05:06] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:05:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1019 ms
[2025-06-02 07:05:07] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:05:07] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 4 ms to minimize.
[2025-06-02 07:05:07] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:05:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 946 ms
[2025-06-02 07:05:08] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 2 ms to minimize.
[2025-06-02 07:05:08] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:05:09] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:05:09] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:05:09] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:05:09] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2025-06-02 07:05:10] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:05:10] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:05:10] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:05:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2016 ms
[2025-06-02 07:05:10] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2025-06-02 07:05:11] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:05:11] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:05:11] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:05:11] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2025-06-02 07:05:11] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:05:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1107 ms
[2025-06-02 07:05:12] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:05:12] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:05:12] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:05:12] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:05:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 904 ms
[2025-06-02 07:05:13] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2025-06-02 07:05:14] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:05:14] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2025-06-02 07:05:16] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:05:16] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:05:17] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:05:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2025-06-02 07:05:19] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2025-06-02 07:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-02 07:05:20] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2025-06-02 07:05:20] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2025-06-02 07:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2025-06-02 07:05:22] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:05:22] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:05:22] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:05:22] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:05:22] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
[2025-06-02 07:05:23] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:05:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1309 ms
[2025-06-02 07:05:24] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 2 ms to minimize.
[2025-06-02 07:05:24] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:05:24] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:05:24] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:05:24] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 2 ms to minimize.
[2025-06-02 07:05:25] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:05:25] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:05:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1733 ms
[2025-06-02 07:05:26] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 2 ms to minimize.
[2025-06-02 07:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 07:05:27] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:05:28] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:05:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 560 ms
[2025-06-02 07:05:30] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-06-02 07:05:31] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:05:31] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 2 ms to minimize.
[2025-06-02 07:05:31] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:05:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 700 ms
[2025-06-02 07:05:33] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2025-06-02 07:05:33] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2025-06-02 07:05:34] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-06-02 07:05:34] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:05:34] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:05:35] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:05:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2025-06-02 07:05:35] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:05:35] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:05:36] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:05:36] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:05:36] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:05:36] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:05:37] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:05:37] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:05:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1955 ms
[2025-06-02 07:05:38] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:05:38] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:05:39] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:05:39] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:05:39] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:05:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1332 ms
[2025-06-02 07:05:40] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2025-06-02 07:05:40] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2025-06-02 07:05:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2025-06-02 07:05:41] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 2 ms to minimize.
[2025-06-02 07:05:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-02 07:05:42] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:05:42] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:05:42] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:05:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2025-06-02 07:05:44] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-06-02 07:05:46] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:05:46] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2025-06-02 07:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2025-06-02 07:05:54] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:05:54] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:05:54] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:05:55] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:05:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 934 ms
[2025-06-02 07:05:55] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2025-06-02 07:06:00] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2025-06-02 07:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1720 ms
[2025-06-02 07:06:03] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2025-06-02 07:06:03] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:06:04] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:06:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2025-06-02 07:06:06] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:06:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2025-06-02 07:06:06] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:06:07] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:06:07] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:06:07] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:06:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 965 ms
[2025-06-02 07:06:08] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:06:08] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:06:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:06:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:06:10] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 3 ms to minimize.
[2025-06-02 07:06:10] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:06:10] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:06:10] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 3 ms to minimize.
[2025-06-02 07:06:10] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 3 ms to minimize.
[2025-06-02 07:06:11] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:06:11] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:06:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1824 ms
[2025-06-02 07:06:12] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2025-06-02 07:06:12] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 4 ms to minimize.
[2025-06-02 07:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2025-06-02 07:06:13] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-02 07:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2025-06-02 07:06:13] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
TRAPS : Iteration 1
[2025-06-02 07:06:14] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:06:14] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 2 ms to minimize.
[2025-06-02 07:06:15] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:06:15] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 2 ms to minimize.
[2025-06-02 07:06:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1234 ms
[2025-06-02 07:06:19] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-06-02 07:06:22] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2025-06-02 07:06:23] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2025-06-02 07:06:24] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 2 ms to minimize.
[2025-06-02 07:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
TRAPS : Iteration 2
[2025-06-02 07:06:25] [INFO ] After 199136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :269
[2025-06-02 07:06:25] [INFO ] After 200029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :269
RANDOM walk for 97 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 80 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 56 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 76 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 73 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 67 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 53 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
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 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 785115 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 785115 steps, saw 103650 distinct states, run finished after 3009 ms. (steps per millisecond=260 ) properties seen :0
[2025-06-02 07:06:28] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:06:28] [INFO ] Invariant cache hit.
[2025-06-02 07:06:28] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:06:29] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 3 ms to minimize.
[2025-06-02 07:06:30] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:06:30] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 3 ms to minimize.
[2025-06-02 07:06:30] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:06:30] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 4 ms to minimize.
[2025-06-02 07:06:31] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 3 ms to minimize.
[2025-06-02 07:06:31] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 4 ms to minimize.
[2025-06-02 07:06:31] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:06:31] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:06:32] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 3 ms to minimize.
[2025-06-02 07:06:32] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 11/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3631 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4145ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 115 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 777879 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 777879 steps, saw 102995 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2025-06-02 07:06:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:06:35] [INFO ] Invariant cache hit.
[2025-06-02 07:06:35] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:06:37] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 4 ms to minimize.
[2025-06-02 07:06:37] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:06:37] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:06:37] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 3 ms to minimize.
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 4 ms to minimize.
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 11/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3518 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4011ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 32 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:06:40] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:06:40] [INFO ] Invariant cache hit.
[2025-06-02 07:06:40] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-06-02 07:06:40] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:06:40] [INFO ] Invariant cache hit.
[2025-06-02 07:06:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:06:43] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
[2025-06-02 07:06:43] [INFO ] Redundant transitions in 31 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:06:43] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:06:43] [INFO ] Invariant cache hit.
[2025-06-02 07:06:43] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 4 ms to minimize.
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 3 ms to minimize.
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 4 ms to minimize.
[2025-06-02 07:07:00] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:07:00] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:07:00] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:07:00] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:07:01] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 4 ms to minimize.
[2025-06-02 07:07:01] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:07:01] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 2 ms to minimize.
[2025-06-02 07:07:01] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:07:01] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:07:02] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:07:02] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:07:02] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:07:02] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:07:03] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:03] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2025-06-02 07:07:03] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:07:04] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:07:04] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:07:04] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:07:04] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:07:05] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:07:05] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:07:05] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 4 ms to minimize.
[2025-06-02 07:07:05] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:07:06] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:07:06] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:07:06] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:07:06] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 3 ms to minimize.
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:07:08] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:07:08] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30029 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:15] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2025-06-02 07:07:15] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 4 ms to minimize.
[2025-06-02 07:07:15] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
[2025-06-02 07:07:16] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:07:16] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:07:16] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:07:16] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:07:16] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 4 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 3 ms to minimize.
[2025-06-02 07:07:17] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:07:18] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:07:18] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:07:18] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 3 ms to minimize.
[2025-06-02 07:07:18] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:07:18] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:07:19] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:20] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 4 ms to minimize.
[2025-06-02 07:07:20] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:07:20] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:07:20] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 96 places in 213 ms of which 2 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2025-06-02 07:07:21] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:07:22] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:07:22] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:07:22] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:07:22] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:07:22] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:07:23] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:07:23] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:07:23] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 2 ms to minimize.
[2025-06-02 07:07:23] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:07:23] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:24] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:07:26] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2025-06-02 07:07:27] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2025-06-02 07:07:27] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:07:27] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:07:27] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:07:27] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:07:28] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:07:28] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:07:28] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 4 ms to minimize.
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2025-06-02 07:07:30] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:07:30] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:07:30] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:07:30] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:07:30] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:07:31] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2025-06-02 07:07:31] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:07:31] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:07:31] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:07:31] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:07:33] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:34] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2025-06-02 07:07:34] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:07:34] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:07:34] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2025-06-02 07:07:34] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:07:35] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:07:39] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:07:40] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:07:40] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:07:40] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2025-06-02 07:07:40] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:07:40] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:07:41] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:07:41] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:07:42] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:07:42] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:07:42] [INFO ] Deduced a trap composed of 56 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:07:42] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:07:42] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:07:43] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:07:43] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:07:43] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:07:43] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
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 Int declared 584/1944 variables, and 764 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30025 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 157/157 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63812 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 4 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 50 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 07:07:43] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:07:43] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 07:07:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:07:43] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 07:07:43] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 07:07:43] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 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 40000 steps (8 resets) in 184 ms. (216 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 787689 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 787689 steps, saw 103935 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2025-06-02 07:07:47] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 07:07:47] [INFO ] Computed 23 invariants in 15 ms
[2025-06-02 07:07:47] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:07:48] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 4 ms to minimize.
[2025-06-02 07:07:48] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:07:48] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:07:48] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:07:49] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:07:49] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:07:49] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:07:49] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 3 ms to minimize.
[2025-06-02 07:07:50] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:07:50] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:07:50] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:07:50] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:07:51] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2025-06-02 07:07:51] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:07:51] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2025-06-02 07:07:51] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:07:52] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 17/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4928 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 5415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 40 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 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 795177 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 795177 steps, saw 104639 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2025-06-02 07:07:55] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:07:55] [INFO ] Invariant cache hit.
[2025-06-02 07:07:55] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:07:56] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:07:56] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:07:57] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:07:57] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:07:57] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 3 ms to minimize.
[2025-06-02 07:07:57] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 3 ms to minimize.
[2025-06-02 07:07:58] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 4 ms to minimize.
[2025-06-02 07:07:58] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:07:58] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 4 ms to minimize.
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 4 ms to minimize.
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 4 ms to minimize.
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 17/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5027 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 5528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 45 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 36 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:08:01] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:08:01] [INFO ] Invariant cache hit.
[2025-06-02 07:08:01] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-06-02 07:08:01] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:08:01] [INFO ] Invariant cache hit.
[2025-06-02 07:08:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:08:04] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3043 ms to find 0 implicit places.
[2025-06-02 07:08:04] [INFO ] Redundant transitions in 24 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:08:04] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:08:04] [INFO ] Invariant cache hit.
[2025-06-02 07:08:04] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:19] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:08:19] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:08:20] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 3 ms to minimize.
[2025-06-02 07:08:20] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 4 ms to minimize.
[2025-06-02 07:08:20] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:08:20] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:08:21] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:08:21] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:08:21] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 4 ms to minimize.
[2025-06-02 07:08:21] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:08:22] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:08:22] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:08:22] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 2 ms to minimize.
[2025-06-02 07:08:22] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2025-06-02 07:08:22] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:08:23] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:08:23] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:08:23] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:08:23] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:08:24] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:24] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:08:24] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:08:25] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:08:25] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 3 ms to minimize.
[2025-06-02 07:08:25] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:08:25] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:08:27] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:08:27] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:08:27] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 4 ms to minimize.
[2025-06-02 07:08:28] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 4 ms to minimize.
[2025-06-02 07:08:28] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 4 ms to minimize.
[2025-06-02 07:08:28] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:08:28] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:08:28] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:08:29] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 3 ms to minimize.
[2025-06-02 07:08:29] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30033 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:36] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 4 ms to minimize.
[2025-06-02 07:08:36] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:08:36] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:08:37] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:08:37] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:08:37] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:08:37] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 2 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 3 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:08:39] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 3 ms to minimize.
[2025-06-02 07:08:39] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:08:39] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2025-06-02 07:08:39] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:08:39] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:08:40] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 3 ms to minimize.
[2025-06-02 07:08:40] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:41] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:08:41] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:08:41] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:08:41] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:08:42] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:08:43] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:08:43] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:08:43] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:08:43] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:08:43] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2025-06-02 07:08:44] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:08:44] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:08:44] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:08:44] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:08:44] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:08:47] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:08:48] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:08:48] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:08:48] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:08:48] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:08:48] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2025-06-02 07:08:49] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:08:49] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:50] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 4 ms to minimize.
[2025-06-02 07:08:50] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:08:50] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 2 ms to minimize.
[2025-06-02 07:08:51] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:08:51] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 4 ms to minimize.
[2025-06-02 07:08:51] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:08:51] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:08:51] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:08:52] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:08:52] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:08:52] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:08:52] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:08:52] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:08:53] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:08:53] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2025-06-02 07:08:53] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:08:53] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:08:53] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:08:54] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2025-06-02 07:08:54] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:08:55] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 3 ms to minimize.
[2025-06-02 07:08:55] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:08:55] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:08:55] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2025-06-02 07:08:55] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2025-06-02 07:08:56] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:08:56] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:08:56] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:08:56] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:08:56] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:08:57] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:08:58] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:08:58] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:08:58] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:08:59] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:09:01] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:09:01] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:09:01] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:09:01] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:09:01] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2025-06-02 07:09:02] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:09:02] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:09:02] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:09:03] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:09:03] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:09:03] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 2 ms to minimize.
[2025-06-02 07:09:03] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:09:04] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:09:04] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:09:04] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:09:04] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:09:04] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 764 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30032 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 157/157 constraints]
After SMT, in 60695ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63834 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 5 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 1 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 30 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 07:09:05] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:09:05] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 07:09:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:09:05] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 07:09:05] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 07:09:05] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 788121 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 788121 steps, saw 103982 distinct states, run finished after 3003 ms. (steps per millisecond=262 ) properties seen :0
[2025-06-02 07:09:08] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 07:09:08] [INFO ] Computed 23 invariants in 9 ms
[2025-06-02 07:09:08] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:09:09] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 4 ms to minimize.
[2025-06-02 07:09:09] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 4 ms to minimize.
[2025-06-02 07:09:09] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:09:10] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:09:10] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2025-06-02 07:09:10] [INFO ] Deduced a trap composed of 60 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:09:10] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 4 ms to minimize.
[2025-06-02 07:09:11] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:09:11] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:09:11] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:09:11] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 11/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:09:12] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 3 ms to minimize.
[2025-06-02 07:09:12] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 3 ms to minimize.
[2025-06-02 07:09:12] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 3 ms to minimize.
[2025-06-02 07:09:12] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:09:13] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:09:13] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 6/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5011 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 5522ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 584/584 places, 1696/1696 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 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 777168 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 777168 steps, saw 102921 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2025-06-02 07:09:16] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:09:16] [INFO ] Invariant cache hit.
[2025-06-02 07:09:16] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:09:17] [INFO ] Deduced a trap composed of 84 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:09:18] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 3 ms to minimize.
[2025-06-02 07:09:18] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
[2025-06-02 07:09:18] [INFO ] Deduced a trap composed of 72 places in 252 ms of which 3 ms to minimize.
[2025-06-02 07:09:18] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:09:19] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:09:19] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:09:19] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:09:19] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 4 ms to minimize.
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:09:21] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:09:21] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:21] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 3 ms to minimize.
[2025-06-02 07:09:21] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:09:22] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 18/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:09:22] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:09:22] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 2/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:09:23] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 1/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1944 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1944 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6105 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 6597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:09:23] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
[2025-06-02 07:09:23] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-02 07:09:23] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
[2025-06-02 07:09:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:09:26] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2025-06-02 07:09:26] [INFO ] Redundant transitions in 30 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:09:26] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:09:26] [INFO ] Invariant cache hit.
[2025-06-02 07:09:26] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:09:41] [INFO ] Deduced a trap composed of 78 places in 245 ms of which 4 ms to minimize.
[2025-06-02 07:09:41] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:09:41] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:09:42] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:09:42] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:42] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:09:42] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:09:43] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:09:43] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2025-06-02 07:09:43] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:43] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:43] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 2 ms to minimize.
[2025-06-02 07:09:44] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:09:44] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:09:44] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2025-06-02 07:09:44] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:09:46] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 4 ms to minimize.
[2025-06-02 07:09:46] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 4 ms to minimize.
[2025-06-02 07:09:46] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:09:48] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:09:48] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:09:48] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 4 ms to minimize.
[2025-06-02 07:09:48] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 4 ms to minimize.
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:09:51] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30032 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:09:58] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:09:58] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2025-06-02 07:09:59] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:09:59] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:09:59] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:09:59] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:09:59] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 2 ms to minimize.
[2025-06-02 07:10:00] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:10:00] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 2 ms to minimize.
[2025-06-02 07:10:00] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:10:00] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:10:00] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:10:01] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:10:02] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:10:02] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:10:03] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2025-06-02 07:10:03] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:10:03] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:10:03] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:10:04] [INFO ] Deduced a trap composed of 96 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:10:04] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-02 07:10:04] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 2 ms to minimize.
[2025-06-02 07:10:04] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:10:04] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 5 ms to minimize.
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 2 ms to minimize.
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2025-06-02 07:10:07] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:10:08] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:10:08] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 2 ms to minimize.
[2025-06-02 07:10:08] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:10:08] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:10:08] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 2 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:10:09] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:10:10] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:10:10] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:10:10] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:10:10] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:10:10] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:10:11] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:10:11] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:10:11] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:10:11] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:10:12] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 4 ms to minimize.
[2025-06-02 07:10:12] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:10:13] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:10:13] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 4 ms to minimize.
[2025-06-02 07:10:13] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 4 ms to minimize.
[2025-06-02 07:10:13] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 3 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 2 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:10:15] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:10:16] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:10:16] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:10:17] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:10:17] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:10:17] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 1 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:10:18] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:10:19] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:10:20] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2025-06-02 07:10:20] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2025-06-02 07:10:20] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:10:20] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:10:21] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 3 ms to minimize.
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:10:24] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 2 ms to minimize.
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 3 ms to minimize.
[2025-06-02 07:10:26] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2025-06-02 07:10:26] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 2 ms to minimize.
[2025-06-02 07:10:26] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 2 ms to minimize.
[2025-06-02 07:10:26] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:10:26] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 763 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30033 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 156/156 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63597 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 1 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 15 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 07:10:26] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:10:26] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 07:10:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:10:27] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 07:10:27] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 07:10:27] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 56 ms.
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 794457 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 794457 steps, saw 104544 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2025-06-02 07:10:30] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 07:10:30] [INFO ] Computed 23 invariants in 10 ms
[2025-06-02 07:10:30] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:10:31] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 4 ms to minimize.
[2025-06-02 07:10:31] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2025-06-02 07:10:31] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:10:31] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:10:32] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:10:32] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:10:32] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:10:32] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:10:33] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:10:33] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:10:33] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:10:33] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:10:34] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:10:34] [INFO ] Deduced a trap composed of 95 places in 207 ms of which 3 ms to minimize.
[2025-06-02 07:10:34] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:10:34] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 16/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4699 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 5236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 36 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 782730 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 1
Probabilistic random walk after 782730 steps, saw 103443 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2025-06-02 07:10:38] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:10:38] [INFO ] Invariant cache hit.
[2025-06-02 07:10:38] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:10:39] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 4 ms to minimize.
[2025-06-02 07:10:39] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2025-06-02 07:10:40] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:10:40] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:10:40] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 4 ms to minimize.
[2025-06-02 07:10:40] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 4 ms to minimize.
[2025-06-02 07:10:41] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 4 ms to minimize.
[2025-06-02 07:10:41] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 4 ms to minimize.
[2025-06-02 07:10:41] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:10:41] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 4 ms to minimize.
[2025-06-02 07:10:42] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:10:42] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:10:42] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:10:42] [INFO ] Deduced a trap composed of 95 places in 211 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 14/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:10:43] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 4 ms to minimize.
[2025-06-02 07:10:43] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:10:43] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:10:43] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:10:44] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 5/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1944 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5525 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 6004ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 18 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:10:44] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:10:44] [INFO ] Invariant cache hit.
[2025-06-02 07:10:44] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-02 07:10:44] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:10:44] [INFO ] Invariant cache hit.
[2025-06-02 07:10:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:10:47] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 2985 ms to find 0 implicit places.
[2025-06-02 07:10:47] [INFO ] Redundant transitions in 23 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:10:47] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:10:47] [INFO ] Invariant cache hit.
[2025-06-02 07:10:47] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:02] [INFO ] Deduced a trap composed of 78 places in 235 ms of which 4 ms to minimize.
[2025-06-02 07:11:03] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:11:03] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:11:03] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 4 ms to minimize.
[2025-06-02 07:11:03] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 4 ms to minimize.
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 3 ms to minimize.
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 2 ms to minimize.
[2025-06-02 07:11:06] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:11:06] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:11:06] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:11:06] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2025-06-02 07:11:07] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:11:07] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:07] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:11:08] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:11:08] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:11:08] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:11:08] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 4 ms to minimize.
[2025-06-02 07:11:09] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:11:09] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:11:09] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:11:09] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 3 ms to minimize.
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 4 ms to minimize.
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:11:12] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:11:12] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:11:12] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30027 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:19] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 3 ms to minimize.
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 3 ms to minimize.
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:11:21] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2025-06-02 07:11:21] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:11:21] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 4 ms to minimize.
[2025-06-02 07:11:21] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:11:21] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2025-06-02 07:11:22] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:11:23] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:11:23] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:11:23] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:11:23] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:24] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 07:11:24] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:11:25] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2025-06-02 07:11:25] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:11:25] [INFO ] Deduced a trap composed of 96 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:11:25] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:11:25] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
[2025-06-02 07:11:27] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:11:27] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:11:27] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:11:27] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:11:27] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2025-06-02 07:11:28] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 3 ms to minimize.
[2025-06-02 07:11:28] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2025-06-02 07:11:28] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:29] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2025-06-02 07:11:29] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:11:29] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:11:32] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:34] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:11:34] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:11:34] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2025-06-02 07:11:34] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:11:36] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2025-06-02 07:11:36] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2025-06-02 07:11:36] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:11:36] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:11:36] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2025-06-02 07:11:37] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:39] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:11:39] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:11:39] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:11:39] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2025-06-02 07:11:39] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:11:40] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:11:41] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 2 ms to minimize.
[2025-06-02 07:11:42] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2025-06-02 07:11:42] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:11:42] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:11:44] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:11:45] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:11:45] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2025-06-02 07:11:45] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:11:45] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2025-06-02 07:11:45] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:11:46] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:11:46] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 2 ms to minimize.
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2025-06-02 07:11:48] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 60637ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63691 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 0 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 15 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 07:11:48] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:11:48] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 07:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:11:48] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 07:11:48] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 07:11:48] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 59 ms.
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 795969 steps, run timeout after 3019 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 795969 steps, saw 104691 distinct states, run finished after 3019 ms. (steps per millisecond=263 ) properties seen :0
[2025-06-02 07:11:51] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 07:11:51] [INFO ] Computed 23 invariants in 3 ms
[2025-06-02 07:11:51] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:11:52] [INFO ] Deduced a trap composed of 58 places in 257 ms of which 4 ms to minimize.
[2025-06-02 07:11:52] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 4 ms to minimize.
[2025-06-02 07:11:52] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2025-06-02 07:11:53] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 4 ms to minimize.
[2025-06-02 07:11:53] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:11:53] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:11:53] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:11:54] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:11:54] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 9/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:11:54] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 1/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1944 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3231 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 18 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 795600 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 795600 steps, saw 104650 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2025-06-02 07:11:58] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:11:58] [INFO ] Invariant cache hit.
[2025-06-02 07:11:58] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:11:59] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:11:59] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 4 ms to minimize.
[2025-06-02 07:11:59] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:12:00] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2025-06-02 07:12:00] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 3 ms to minimize.
[2025-06-02 07:12:00] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2025-06-02 07:12:00] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 3 ms to minimize.
[2025-06-02 07:12:01] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:12:01] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:12:01] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:12:01] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:12:02] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:12:02] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2025-06-02 07:12:02] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 14/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4263 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 4790ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:12:02] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:12:02] [INFO ] Invariant cache hit.
[2025-06-02 07:12:03] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-02 07:12:03] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:12:03] [INFO ] Invariant cache hit.
[2025-06-02 07:12:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:12:05] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
[2025-06-02 07:12:05] [INFO ] Redundant transitions in 30 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:12:05] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:12:05] [INFO ] Invariant cache hit.
[2025-06-02 07:12:05] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:21] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:12:21] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
[2025-06-02 07:12:21] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 4 ms to minimize.
[2025-06-02 07:12:21] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:12:22] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2025-06-02 07:12:22] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2025-06-02 07:12:22] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2025-06-02 07:12:22] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 3 ms to minimize.
[2025-06-02 07:12:24] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2025-06-02 07:12:24] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 2 ms to minimize.
[2025-06-02 07:12:24] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:12:24] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 3 ms to minimize.
[2025-06-02 07:12:25] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:12:25] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:12:25] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:26] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2025-06-02 07:12:26] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2025-06-02 07:12:26] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 3 ms to minimize.
[2025-06-02 07:12:26] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 4 ms to minimize.
[2025-06-02 07:12:27] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:12:27] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:12:27] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2025-06-02 07:12:27] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:12:28] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:12:28] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 3 ms to minimize.
[2025-06-02 07:12:28] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 4 ms to minimize.
[2025-06-02 07:12:28] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 3 ms to minimize.
[2025-06-02 07:12:29] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 3 ms to minimize.
[2025-06-02 07:12:29] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
[2025-06-02 07:12:29] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2025-06-02 07:12:29] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 3 ms to minimize.
[2025-06-02 07:12:30] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:12:30] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:12:30] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:12:30] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 647 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30026 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 40/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:37] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 3 ms to minimize.
[2025-06-02 07:12:38] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:12:38] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:12:38] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 4 ms to minimize.
[2025-06-02 07:12:38] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:12:39] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2025-06-02 07:12:39] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:12:39] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 3 ms to minimize.
[2025-06-02 07:12:39] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2025-06-02 07:12:39] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 3 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 2 ms to minimize.
[2025-06-02 07:12:40] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2025-06-02 07:12:41] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 3 ms to minimize.
[2025-06-02 07:12:41] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 4 ms to minimize.
[2025-06-02 07:12:41] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 3 ms to minimize.
[2025-06-02 07:12:41] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:42] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:12:42] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:12:43] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:12:43] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
[2025-06-02 07:12:43] [INFO ] Deduced a trap composed of 96 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:12:43] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:12:43] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:12:44] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:12:44] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:12:44] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2025-06-02 07:12:44] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2025-06-02 07:12:44] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2025-06-02 07:12:45] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
[2025-06-02 07:12:46] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2025-06-02 07:12:46] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:47] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:12:47] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2025-06-02 07:12:47] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 4 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:12:48] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 2 ms to minimize.
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:52] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 3 ms to minimize.
[2025-06-02 07:12:52] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:12:52] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 2 ms to minimize.
[2025-06-02 07:12:52] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2025-06-02 07:12:52] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 3 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 2 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 2 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2025-06-02 07:12:53] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2025-06-02 07:12:54] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2025-06-02 07:12:54] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:12:54] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:12:54] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:12:54] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:12:55] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2025-06-02 07:12:55] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 2 ms to minimize.
[2025-06-02 07:12:55] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 4 ms to minimize.
[2025-06-02 07:12:55] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:12:56] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2025-06-02 07:12:57] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2025-06-02 07:12:58] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2025-06-02 07:12:59] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2025-06-02 07:12:59] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-06-02 07:12:59] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2025-06-02 07:12:59] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2025-06-02 07:13:00] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:13:00] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2025-06-02 07:13:02] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2025-06-02 07:13:02] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2025-06-02 07:13:02] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2025-06-02 07:13:02] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 3 ms to minimize.
[2025-06-02 07:13:03] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2025-06-02 07:13:03] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2025-06-02 07:13:03] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 2 ms to minimize.
[2025-06-02 07:13:04] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2025-06-02 07:13:04] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 2 ms to minimize.
[2025-06-02 07:13:04] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 2 ms to minimize.
[2025-06-02 07:13:04] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:13:04] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2025-06-02 07:13:05] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2025-06-02 07:13:05] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2025-06-02 07:13:05] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2025-06-02 07:13:05] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
[2025-06-02 07:13:05] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2025-06-02 07:13:06] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:13:06] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
SMT process timed out in 60781ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63606 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 0 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 15 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 07:13:06] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:13:06] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 07:13:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:13:06] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 07:13:06] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 07:13:06] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 52 ms.
RANDOM walk for 29855 steps (6 resets) in 101 ms. (292 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799497 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799497 steps, saw 105056 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2025-06-02 07:13:09] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2025-06-02 07:13:09] [INFO ] Computed 23 invariants in 10 ms
[2025-06-02 07:13:09] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:13:10] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 4 ms to minimize.
[2025-06-02 07:13:11] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2025-06-02 07:13:11] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 3 ms to minimize.
[2025-06-02 07:13:11] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 4 ms to minimize.
[2025-06-02 07:13:11] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2025-06-02 07:13:12] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2025-06-02 07:13:12] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2025-06-02 07:13:12] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2025-06-02 07:13:12] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2025-06-02 07:13:13] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:13:13] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:13:13] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2025-06-02 07:13:13] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 13/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3875 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4376ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 21 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797832 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797832 steps, saw 104894 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2025-06-02 07:13:17] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:13:17] [INFO ] Invariant cache hit.
[2025-06-02 07:13:17] [INFO ] State equation strengthened by 497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 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) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 07:13:18] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 3 ms to minimize.
[2025-06-02 07:13:18] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 4 ms to minimize.
[2025-06-02 07:13:18] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 4 ms to minimize.
[2025-06-02 07:13:18] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 4 ms to minimize.
[2025-06-02 07:13:19] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 4 ms to minimize.
[2025-06-02 07:13:19] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 3 ms to minimize.
[2025-06-02 07:13:19] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2025-06-02 07:13:19] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:13:20] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-06-02 07:13:20] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 3 ms to minimize.
[2025-06-02 07:13:20] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2025-06-02 07:13:20] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 3 ms to minimize.
[2025-06-02 07:13:21] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 3 ms to minimize.
[2025-06-02 07:13:21] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 14/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4069 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 4556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2025-06-02 07:13:21] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:13:21] [INFO ] Invariant cache hit.
[2025-06-02 07:13:22] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-02 07:13:22] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:13:22] [INFO ] Invariant cache hit.
[2025-06-02 07:13:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 07:13:24] [INFO ] Implicit Places using invariants and state equation in 2458 ms returned []
Implicit Place search using SMT with State Equation took 2837 ms to find 0 implicit places.
[2025-06-02 07:13:24] [INFO ] Redundant transitions in 29 ms returned []
Running 1688 sub problems to find dead transitions.
[2025-06-02 07:13:24] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2025-06-02 07:13:24] [INFO ] Invariant cache hit.
[2025-06-02 07:13:24] [INFO ] State equation strengthened by 497 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-7"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Peterson-PT-7, 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 r154-tall-174876825600397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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