About the Execution of 2024-gold for Anderson-PT-11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15689.950 | 1800000.00 | 3326558.00 | 3184.50 | [undef] | Time out reached |
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.r014-tall-174853743400127.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 Anderson-PT-11, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400127
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 1748542933144
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:22:14] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2025-05-29 18:22:14] [INFO ] Transformed 749 places.
[2025-05-29 18:22:14] [INFO ] Transformed 3245 transitions.
[2025-05-29 18:22:14] [INFO ] Found NUPN structural information;
[2025-05-29 18:22:14] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 328 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 749 transition count 3135
Deduced a syphon composed of 110 places in 12 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 639 transition count 3135
Applied a total of 220 rules in 126 ms. Remains 639 /749 variables (removed 110) and now considering 3135/3245 (removed 110) transitions.
// Phase 1: matrix 3135 rows 639 cols
[2025-05-29 18:22:14] [INFO ] Computed 25 invariants in 104 ms
[2025-05-29 18:22:16] [INFO ] Implicit Places using invariants in 1983 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2016 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 638/749 places, 3135/3245 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 638 transition count 3014
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 517 transition count 3014
Applied a total of 242 rules in 25 ms. Remains 517 /638 variables (removed 121) and now considering 3014/3135 (removed 121) transitions.
// Phase 1: matrix 3014 rows 517 cols
[2025-05-29 18:22:16] [INFO ] Computed 24 invariants in 26 ms
[2025-05-29 18:22:18] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2025-05-29 18:22:18] [INFO ] Invariant cache hit.
[2025-05-29 18:22:19] [INFO ] State equation strengthened by 209 read => feed constraints.
[2025-05-29 18:22:24] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned []
Implicit Place search using SMT with State Equation took 7675 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 517/749 places, 3014/3245 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 9861 ms. Remains : 517/749 places, 3014/3245 transitions.
Initial state reduction rules removed 11 formulas.
RANDOM walk for 40000 steps (8 resets) in 5390 ms. (7 steps per ms) remains 1752/3003 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1752/1752 properties
[2025-05-29 18:22:26] [INFO ] Invariant cache hit.
[2025-05-29 18:22:26] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 228/228 constraints. Problems are: Problem set: 0 solved, 1752 unsolved
SMT process timed out in 12159ms, After SMT, problems are : Problem set: 0 solved, 1752 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 228 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 3014/3014 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 473 transition count 2970
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 473 transition count 2970
Applied a total of 88 rules in 156 ms. Remains 473 /517 variables (removed 44) and now considering 2970/3014 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 473/517 places, 2970/3014 transitions.
RANDOM walk for 1885190 steps (4 resets) in 120004 ms. (15 steps per ms) remains 994/1752 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 982/994 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 981/982 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 979/981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 976/979 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 871/976 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 871/871 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 770/871 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 769/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 769/769 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 752/769 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 752/752 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 751/752 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 751/751 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 751/751 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 722/751 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 632/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 623/632 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 623/623 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 623/623 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 622/623 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 621/622 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 593/621 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 593/593 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 592/593 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 592/592 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 592/592 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 591/592 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 591/591 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 591/591 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 591/591 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 591/591 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 591/591 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 585/591 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 585/585 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 585/585 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 585/585 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 585/585 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 585/585 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 570/585 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 570/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 570/570 properties
// Phase 1: matrix 2970 rows 473 cols
[2025-05-29 18:23:10] [INFO ] Computed 24 invariants in 14 ms
[2025-05-29 18:23:10] [INFO ] State equation strengthened by 176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 284/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-05-29 18:23:16] [INFO ] Deduced a trap composed of 279 places in 413 ms of which 28 ms to minimize.
[2025-05-29 18:23:17] [INFO ] Deduced a trap composed of 196 places in 364 ms of which 4 ms to minimize.
[2025-05-29 18:23:17] [INFO ] Deduced a trap composed of 177 places in 368 ms of which 3 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 227 places in 343 ms of which 12 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 231 places in 333 ms of which 3 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 217 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 319 places in 370 ms of which 3 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 259 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:23:20] [INFO ] Deduced a trap composed of 204 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:23:20] [INFO ] Deduced a trap composed of 220 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:23:20] [INFO ] Deduced a trap composed of 244 places in 330 ms of which 3 ms to minimize.
[2025-05-29 18:23:21] [INFO ] Deduced a trap composed of 307 places in 355 ms of which 3 ms to minimize.
[2025-05-29 18:23:21] [INFO ] Deduced a trap composed of 284 places in 337 ms of which 3 ms to minimize.
[2025-05-29 18:23:22] [INFO ] Deduced a trap composed of 303 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:23:22] [INFO ] Deduced a trap composed of 279 places in 334 ms of which 2 ms to minimize.
[2025-05-29 18:23:22] [INFO ] Deduced a trap composed of 236 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:23:23] [INFO ] Deduced a trap composed of 252 places in 340 ms of which 3 ms to minimize.
[2025-05-29 18:23:23] [INFO ] Deduced a trap composed of 218 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:23:23] [INFO ] Deduced a trap composed of 253 places in 346 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-05-29 18:23:30] [INFO ] Deduced a trap composed of 282 places in 329 ms of which 3 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 335 places in 330 ms of which 4 ms to minimize.
[2025-05-29 18:23:33] [INFO ] Deduced a trap composed of 266 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:23:34] [INFO ] Deduced a trap composed of 203 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 272 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 250 places in 311 ms of which 4 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 241 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 240 places in 370 ms of which 3 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 224 places in 361 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 182 places in 355 ms of which 3 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 200 places in 334 ms of which 3 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 175 places in 367 ms of which 3 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:23:40] [INFO ] Deduced a trap composed of 239 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:23:40] [INFO ] Deduced a trap composed of 245 places in 356 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-05-29 18:23:43] [INFO ] Deduced a trap composed of 279 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:23:44] [INFO ] Deduced a trap composed of 227 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:23:44] [INFO ] Deduced a trap composed of 238 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:23:44] [INFO ] Deduced a trap composed of 255 places in 308 ms of which 2 ms to minimize.
[2025-05-29 18:23:45] [INFO ] Deduced a trap composed of 271 places in 313 ms of which 4 ms to minimize.
[2025-05-29 18:23:45] [INFO ] Deduced a trap composed of 308 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:23:45] [INFO ] Deduced a trap composed of 266 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:23:46] [INFO ] Deduced a trap composed of 313 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:23:46] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 311 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 313 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:23:48] [INFO ] Deduced a trap composed of 305 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:23:48] [INFO ] Deduced a trap composed of 289 places in 304 ms of which 3 ms to minimize.
[2025-05-29 18:23:48] [INFO ] Deduced a trap composed of 345 places in 304 ms of which 3 ms to minimize.
[2025-05-29 18:23:48] [INFO ] Deduced a trap composed of 330 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 318 places in 310 ms of which 4 ms to minimize.
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 276 places in 302 ms of which 4 ms to minimize.
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 2 ms to minimize.
[2025-05-29 18:23:50] [INFO ] Deduced a trap composed of 330 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:23:50] [INFO ] Deduced a trap composed of 317 places in 298 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-05-29 18:23:51] [INFO ] Deduced a trap composed of 303 places in 355 ms of which 3 ms to minimize.
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 336 places in 340 ms of which 4 ms to minimize.
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 291 places in 335 ms of which 3 ms to minimize.
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 349 places in 330 ms of which 2 ms to minimize.
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 261 places in 330 ms of which 3 ms to minimize.
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 342 places in 333 ms of which 3 ms to minimize.
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 299 places in 329 ms of which 3 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 3 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 173 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 321 places in 333 ms of which 3 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 3 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 375 places in 331 ms of which 3 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 3 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 338 places in 340 ms of which 3 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 3 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 236 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:23:57] [INFO ] Deduced a trap composed of 265 places in 335 ms of which 3 ms to minimize.
[2025-05-29 18:23:57] [INFO ] Deduced a trap composed of 175 places in 322 ms of which 3 ms to minimize.
SMT process timed out in 47042ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Fused 570 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 184 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 2970/2970 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 441 transition count 2938
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 441 transition count 2938
Applied a total of 64 rules in 83 ms. Remains 441 /473 variables (removed 32) and now considering 2938/2970 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 441/473 places, 2938/2970 transitions.
RANDOM walk for 3351554 steps (8 resets) in 120004 ms. (27 steps per ms) remains 527/570 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 527/527 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 523/527 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 523/523 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 522/523 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 511/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 511/511 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 510/511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 506/510 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 506/506 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 497/506 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 497/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 495/497 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 495/495 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 471/495 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 471/471 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 470/471 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 470/470 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 454/470 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 454/454 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 454/454 properties
// Phase 1: matrix 2938 rows 441 cols
[2025-05-29 18:24:33] [INFO ] Computed 24 invariants in 15 ms
[2025-05-29 18:24:33] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 259/429 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:24:42] [INFO ] Deduced a trap composed of 359 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:24:42] [INFO ] Deduced a trap composed of 338 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:24:42] [INFO ] Deduced a trap composed of 297 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:24:42] [INFO ] Deduced a trap composed of 336 places in 232 ms of which 3 ms to minimize.
[2025-05-29 18:24:43] [INFO ] Deduced a trap composed of 285 places in 233 ms of which 3 ms to minimize.
[2025-05-29 18:24:43] [INFO ] Deduced a trap composed of 295 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:24:43] [INFO ] Deduced a trap composed of 285 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:24:43] [INFO ] Deduced a trap composed of 275 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:24:44] [INFO ] Deduced a trap composed of 306 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:24:44] [INFO ] Deduced a trap composed of 264 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:24:44] [INFO ] Deduced a trap composed of 310 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 319 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 273 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 315 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 276 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 280 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 297 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 277 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 257 places in 258 ms of which 3 ms to minimize.
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 213 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 264 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 320 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 320 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 270 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 259 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 305 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 269 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 280 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 248 places in 237 ms of which 3 ms to minimize.
[2025-05-29 18:24:58] [INFO ] Deduced a trap composed of 260 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:24:58] [INFO ] Deduced a trap composed of 305 places in 236 ms of which 3 ms to minimize.
[2025-05-29 18:24:58] [INFO ] Deduced a trap composed of 316 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:24:58] [INFO ] Deduced a trap composed of 286 places in 233 ms of which 3 ms to minimize.
[2025-05-29 18:24:59] [INFO ] Deduced a trap composed of 297 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:24:59] [INFO ] Deduced a trap composed of 285 places in 237 ms of which 3 ms to minimize.
[2025-05-29 18:24:59] [INFO ] Deduced a trap composed of 295 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:24:59] [INFO ] Deduced a trap composed of 284 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:25:00] [INFO ] Deduced a trap composed of 296 places in 231 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:00] [INFO ] Deduced a trap composed of 284 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:25:00] [INFO ] Deduced a trap composed of 275 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:25:01] [INFO ] Deduced a trap composed of 279 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:25:01] [INFO ] Deduced a trap composed of 297 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:25:01] [INFO ] Deduced a trap composed of 286 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:25:01] [INFO ] Deduced a trap composed of 277 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:25:02] [INFO ] Deduced a trap composed of 262 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:25:02] [INFO ] Deduced a trap composed of 301 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:25:02] [INFO ] Deduced a trap composed of 252 places in 245 ms of which 3 ms to minimize.
[2025-05-29 18:25:03] [INFO ] Deduced a trap composed of 307 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:25:03] [INFO ] Deduced a trap composed of 285 places in 256 ms of which 3 ms to minimize.
[2025-05-29 18:25:03] [INFO ] Deduced a trap composed of 281 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:25:03] [INFO ] Deduced a trap composed of 276 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:25:04] [INFO ] Deduced a trap composed of 270 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:25:04] [INFO ] Deduced a trap composed of 284 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:25:04] [INFO ] Deduced a trap composed of 231 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:25:05] [INFO ] Deduced a trap composed of 305 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:25:05] [INFO ] Deduced a trap composed of 212 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:25:05] [INFO ] Deduced a trap composed of 283 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:25:05] [INFO ] Deduced a trap composed of 256 places in 253 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:11] [INFO ] Deduced a trap composed of 259 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:25:11] [INFO ] Deduced a trap composed of 285 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:25:11] [INFO ] Deduced a trap composed of 275 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:25:12] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:25:12] [INFO ] Deduced a trap composed of 253 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:25:12] [INFO ] Deduced a trap composed of 257 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:25:12] [INFO ] Deduced a trap composed of 263 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:25:13] [INFO ] Deduced a trap composed of 295 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:25:13] [INFO ] Deduced a trap composed of 254 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:25:13] [INFO ] Deduced a trap composed of 285 places in 235 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 265 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 241 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 274 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 212 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 253 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 253 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 273 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 263 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 253 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 272 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 241 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 288 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 253 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 267 places in 247 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 301 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 292 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 300 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 281 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 3 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 238 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 262 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 269 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 275 places in 233 ms of which 3 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 211 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 220 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 265 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 210 places in 241 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/3379 variables, and 116 constraints, problems are : Problem set: 0 solved, 454 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/12 constraints, State Equation: 0/441 constraints, ReadFeed: 0/144 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 259/429 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:25:56] [INFO ] Deduced a trap composed of 267 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:25:56] [INFO ] Deduced a trap composed of 262 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 267 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 286 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 308 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 286 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 306 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 3 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:26:06] [INFO ] Deduced a trap composed of 255 places in 232 ms of which 2 ms to minimize.
[2025-05-29 18:26:06] [INFO ] Deduced a trap composed of 266 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:26:06] [INFO ] Deduced a trap composed of 279 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:26:06] [INFO ] Deduced a trap composed of 217 places in 233 ms of which 3 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 237 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 253 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 241 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 252 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 221 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 254 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:26:10] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:26:10] [INFO ] Deduced a trap composed of 252 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:26:10] [INFO ] Deduced a trap composed of 229 places in 248 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:26:16] [INFO ] Deduced a trap composed of 268 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:26:17] [INFO ] Deduced a trap composed of 260 places in 239 ms of which 3 ms to minimize.
[2025-05-29 18:26:17] [INFO ] Deduced a trap composed of 216 places in 242 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 253 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 262 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 221 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 282 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 283 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 282 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 283 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 220 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 241 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:26:27] [INFO ] Deduced a trap composed of 220 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:26:27] [INFO ] Deduced a trap composed of 252 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:26:27] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:26:27] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 14/162 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:26:35] [INFO ] Deduced a trap composed of 213 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:26:35] [INFO ] Deduced a trap composed of 263 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:26:35] [INFO ] Deduced a trap composed of 273 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:26:35] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 275 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 264 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 223 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 213 places in 237 ms of which 3 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 222 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 192 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 268 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 259 places in 236 ms of which 3 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 267 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 249 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 246 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 240 places in 244 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 10 (OVERLAPS) 12/441 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:26:49] [INFO ] Deduced a trap composed of 103 places in 374 ms of which 3 ms to minimize.
[2025-05-29 18:26:49] [INFO ] Deduced a trap composed of 160 places in 360 ms of which 2 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 60 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 144 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:26:51] [INFO ] Deduced a trap composed of 133 places in 370 ms of which 2 ms to minimize.
[2025-05-29 18:26:51] [INFO ] Deduced a trap composed of 105 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:26:53] [INFO ] Deduced a trap composed of 118 places in 373 ms of which 3 ms to minimize.
[2025-05-29 18:26:53] [INFO ] Deduced a trap composed of 89 places in 363 ms of which 2 ms to minimize.
[2025-05-29 18:26:54] [INFO ] Deduced a trap composed of 100 places in 381 ms of which 3 ms to minimize.
[2025-05-29 18:26:54] [INFO ] Deduced a trap composed of 112 places in 363 ms of which 3 ms to minimize.
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 145 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 121 places in 368 ms of which 3 ms to minimize.
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 131 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 114 places in 369 ms of which 3 ms to minimize.
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 131 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 95 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 172 places in 375 ms of which 3 ms to minimize.
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 116 places in 369 ms of which 3 ms to minimize.
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 169 places in 364 ms of which 2 ms to minimize.
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 147 places in 358 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2025-05-29 18:27:01] [INFO ] Deduced a trap composed of 154 places in 350 ms of which 2 ms to minimize.
[2025-05-29 18:27:02] [INFO ] Deduced a trap composed of 92 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:27:02] [INFO ] Deduced a trap composed of 97 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:27:02] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 3 ms to minimize.
[2025-05-29 18:27:03] [INFO ] Deduced a trap composed of 85 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:27:03] [INFO ] Deduced a trap composed of 88 places in 369 ms of which 2 ms to minimize.
[2025-05-29 18:27:03] [INFO ] Deduced a trap composed of 88 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:27:04] [INFO ] Deduced a trap composed of 154 places in 367 ms of which 3 ms to minimize.
[2025-05-29 18:27:04] [INFO ] Deduced a trap composed of 108 places in 363 ms of which 3 ms to minimize.
SMT process timed out in 151695ms, After SMT, problems are : Problem set: 0 solved, 454 unsolved
Fused 454 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 170 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 2938/2938 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 435 transition count 2912
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 435 transition count 2912
Applied a total of 12 rules in 61 ms. Remains 435 /441 variables (removed 6) and now considering 2912/2938 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 435/441 places, 2912/2938 transitions.
RANDOM walk for 4000000 steps (8 resets) in 97421 ms. (41 steps per ms) remains 433/454 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 433/433 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 433/433 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 433/433 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 433/433 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 433/433 properties
BEST_FIRST walk for 40004 steps (8 resets) in 594 ms. (67 steps per ms) remains 432/433 properties
BEST_FIRST walk for 40003 steps (8 resets) in 719 ms. (55 steps per ms) remains 432/432 properties
BEST_FIRST walk for 40003 steps (8 resets) in 494 ms. (80 steps per ms) remains 424/432 properties
BEST_FIRST walk for 40003 steps (8 resets) in 576 ms. (69 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40001 steps (8 resets) in 518 ms. (77 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 886 ms. (45 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 501 ms. (79 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40003 steps (8 resets) in 484 ms. (82 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 466 ms. (85 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 488 ms. (81 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40003 steps (8 resets) in 502 ms. (79 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 650 ms. (61 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40001 steps (8 resets) in 528 ms. (75 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40002 steps (8 resets) in 474 ms. (84 steps per ms) remains 424/424 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 422/424 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 422/422 properties
BEST_FIRST walk for 40002 steps (8 resets) in 447 ms. (89 steps per ms) remains 422/422 properties
BEST_FIRST walk for 40003 steps (8 resets) in 430 ms. (92 steps per ms) remains 422/422 properties
BEST_FIRST walk for 40002 steps (8 resets) in 453 ms. (88 steps per ms) remains 409/422 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 408/409 properties
BEST_FIRST walk for 40002 steps (8 resets) in 436 ms. (91 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40003 steps (8 resets) in 510 ms. (78 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40003 steps (8 resets) in 478 ms. (83 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40003 steps (8 resets) in 467 ms. (85 steps per ms) remains 389/408 properties
BEST_FIRST walk for 40002 steps (8 resets) in 447 ms. (89 steps per ms) remains 381/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (8 resets) in 486 ms. (82 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (8 resets) in 406 ms. (98 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (8 resets) in 787 ms. (50 steps per ms) remains 379/381 properties
BEST_FIRST walk for 40002 steps (8 resets) in 420 ms. (95 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (8 resets) in 637 ms. (62 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (8 resets) in 410 ms. (97 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (8 resets) in 625 ms. (63 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 638 ms. (62 steps per ms) remains 376/379 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40003 steps (8 resets) in 466 ms. (85 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40002 steps (8 resets) in 769 ms. (51 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40002 steps (8 resets) in 483 ms. (82 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40001 steps (8 resets) in 630 ms. (63 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 376/376 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 370/376 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 370/370 properties
BEST_FIRST walk for 40001 steps (8 resets) in 431 ms. (92 steps per ms) remains 370/370 properties
BEST_FIRST walk for 40002 steps (8 resets) in 501 ms. (79 steps per ms) remains 370/370 properties
BEST_FIRST walk for 40002 steps (8 resets) in 710 ms. (56 steps per ms) remains 370/370 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 370/370 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 366/370 properties
BEST_FIRST walk for 40002 steps (8 resets) in 657 ms. (60 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 857 ms. (46 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 692 ms. (57 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 449 ms. (88 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 355/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 422 ms. (94 steps per ms) remains 344/355 properties
BEST_FIRST walk for 40004 steps (8 resets) in 741 ms. (53 steps per ms) remains 343/344 properties
BEST_FIRST walk for 40002 steps (8 resets) in 431 ms. (92 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 412 ms. (96 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 294 ms. (135 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 578 ms. (69 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (8 resets) in 451 ms. (88 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40004 steps (8 resets) in 663 ms. (60 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 408 ms. (97 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 418 ms. (95 steps per ms) remains 343/343 properties
BEST_FIRST walk for 40003 steps (8 resets) in 440 ms. (90 steps per ms) remains 336/343 properties
BEST_FIRST walk for 40002 steps (8 resets) in 757 ms. (52 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40002 steps (8 resets) in 408 ms. (97 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 458 ms. (87 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 553 ms. (72 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40002 steps (8 resets) in 397 ms. (100 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40001 steps (8 resets) in 385 ms. (103 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40001 steps (8 resets) in 391 ms. (102 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40002 steps (8 resets) in 648 ms. (61 steps per ms) remains 316/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 385 ms. (103 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 422 ms. (94 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (8 resets) in 745 ms. (53 steps per ms) remains 306/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 306/306 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 300/306 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 657 ms. (60 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40002 steps (8 resets) in 381 ms. (104 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 413 ms. (96 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40002 steps (8 resets) in 413 ms. (96 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 420 ms. (95 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40001 steps (8 resets) in 386 ms. (103 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40002 steps (8 resets) in 524 ms. (76 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 470 ms. (84 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 300/300 properties
BEST_FIRST walk for 40002 steps (8 resets) in 433 ms. (92 steps per ms) remains 299/300 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40001 steps (8 resets) in 372 ms. (107 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40001 steps (8 resets) in 367 ms. (108 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40001 steps (8 resets) in 729 ms. (54 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40001 steps (8 resets) in 369 ms. (108 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40001 steps (8 resets) in 424 ms. (94 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 621 ms. (64 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 577 ms. (69 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 451 ms. (88 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40003 steps (8 resets) in 362 ms. (110 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 364 ms. (109 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 379 ms. (105 steps per ms) remains 299/299 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 298/299 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 295/298 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 294/295 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 293/294 properties
BEST_FIRST walk for 40002 steps (8 resets) in 656 ms. (60 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 356 ms. (112 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 357 ms. (111 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 561 ms. (71 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 543 ms. (73 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 406 ms. (98 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 351 ms. (113 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40001 steps (8 resets) in 542 ms. (73 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 579 ms. (68 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 219/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 219/219 properties
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 219/219 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 219/219 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 218/219 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 431 ms. (92 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 302 ms. (132 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 213 ms. (186 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 342 ms. (116 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 410 ms. (97 steps per ms) remains 217/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 373 ms. (106 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 319 ms. (125 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 304 ms. (131 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40003 steps (8 resets) in 440 ms. (90 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 484 ms. (82 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 213/217 properties
BEST_FIRST walk for 40002 steps (8 resets) in 441 ms. (90 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (8 resets) in 323 ms. (123 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 348 ms. (114 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 422 ms. (94 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (8 resets) in 330 ms. (120 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 423 ms. (94 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (8 resets) in 284 ms. (140 steps per ms) remains 209/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 204/209 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40001 steps (8 resets) in 318 ms. (125 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 201/204 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (8 resets) in 492 ms. (81 steps per ms) remains 199/201 properties
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40002 steps (8 resets) in 532 ms. (75 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 427 ms. (93 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 197/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40000 steps (8 resets) in 392 ms. (101 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 315 ms. (126 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 403 ms. (99 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40001 steps (8 resets) in 290 ms. (137 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 331 ms. (120 steps per ms) remains 178/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 309 ms. (129 steps per ms) remains 168/178 properties
// Phase 1: matrix 2912 rows 435 cols
[2025-05-29 18:28:09] [INFO ] Computed 24 invariants in 13 ms
[2025-05-29 18:28:09] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 328/409 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 25/434 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:14] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 3 ms to minimize.
[2025-05-29 18:28:14] [INFO ] Deduced a trap composed of 118 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:28:14] [INFO ] Deduced a trap composed of 142 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 88 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 92 places in 346 ms of which 2 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 97 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 121 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 96 places in 350 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 119 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 134 places in 348 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 157 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 168 places in 338 ms of which 3 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 133 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 76 places in 345 ms of which 2 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 3 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 3 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 198 places in 343 ms of which 3 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 88 places in 337 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 117 places in 347 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 73 places in 352 ms of which 3 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 88 places in 345 ms of which 2 ms to minimize.
[2025-05-29 18:28:22] [INFO ] Deduced a trap composed of 97 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:28:22] [INFO ] Deduced a trap composed of 101 places in 355 ms of which 2 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 152 places in 406 ms of which 3 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 78 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 114 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 152 places in 358 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 115 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 137 places in 359 ms of which 3 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 127 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 124 places in 350 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 109 places in 341 ms of which 2 ms to minimize.
[2025-05-29 18:28:26] [INFO ] Deduced a trap composed of 114 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:26] [INFO ] Deduced a trap composed of 113 places in 345 ms of which 2 ms to minimize.
[2025-05-29 18:28:27] [INFO ] Deduced a trap composed of 150 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:27] [INFO ] Deduced a trap composed of 103 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:28:27] [INFO ] Deduced a trap composed of 103 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:28] [INFO ] Deduced a trap composed of 109 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:28:28] [INFO ] Deduced a trap composed of 101 places in 356 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:29] [INFO ] Deduced a trap composed of 69 places in 368 ms of which 2 ms to minimize.
[2025-05-29 18:28:29] [INFO ] Deduced a trap composed of 155 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 128 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 102 places in 343 ms of which 3 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 184 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 85 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 156 places in 349 ms of which 2 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 157 places in 373 ms of which 3 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 146 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 129 places in 343 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 108 places in 376 ms of which 3 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 116 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 126 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 90 places in 352 ms of which 3 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 141 places in 347 ms of which 3 ms to minimize.
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 203 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 167 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 110 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 145 places in 353 ms of which 3 ms to minimize.
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 176 places in 366 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:39] [INFO ] Deduced a trap composed of 122 places in 344 ms of which 2 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 106 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 114 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 94 places in 345 ms of which 2 ms to minimize.
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 75 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 124 places in 348 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 79 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 111 places in 352 ms of which 2 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 112 places in 344 ms of which 3 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 123 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 151 places in 349 ms of which 3 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 152 places in 398 ms of which 3 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 86 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 103 places in 352 ms of which 3 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 144 places in 360 ms of which 3 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 100 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:28:46] [INFO ] Deduced a trap composed of 114 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:28:46] [INFO ] Deduced a trap composed of 102 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:28:46] [INFO ] Deduced a trap composed of 180 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:28:47] [INFO ] Deduced a trap composed of 84 places in 360 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:49] [INFO ] Deduced a trap composed of 112 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 147 places in 363 ms of which 3 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 112 places in 359 ms of which 3 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 108 places in 371 ms of which 3 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 89 places in 374 ms of which 2 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 118 places in 374 ms of which 3 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 100 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:28:52] [INFO ] Deduced a trap composed of 184 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:28:52] [INFO ] Deduced a trap composed of 179 places in 371 ms of which 3 ms to minimize.
[2025-05-29 18:28:53] [INFO ] Deduced a trap composed of 125 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:28:53] [INFO ] Deduced a trap composed of 88 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:28:53] [INFO ] Deduced a trap composed of 98 places in 349 ms of which 3 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 106 places in 354 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 157 places in 363 ms of which 3 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 150 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 138 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 81 places in 363 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 108 places in 355 ms of which 2 ms to minimize.
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 101 places in 366 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 114 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 114 places in 382 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 90 places in 362 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 97 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 95 places in 367 ms of which 3 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 113 places in 363 ms of which 3 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 101 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 107 places in 373 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 131 places in 357 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 85 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 152 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 127 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 95 places in 368 ms of which 3 ms to minimize.
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 189 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:29:04] [INFO ] Deduced a trap composed of 127 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:04] [INFO ] Deduced a trap composed of 121 places in 369 ms of which 3 ms to minimize.
[2025-05-29 18:29:04] [INFO ] Deduced a trap composed of 142 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:29:05] [INFO ] Deduced a trap composed of 126 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:29:05] [INFO ] Deduced a trap composed of 79 places in 361 ms of which 2 ms to minimize.
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:29:12] [INFO ] Deduced a trap composed of 100 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:13] [INFO ] Deduced a trap composed of 116 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:29:13] [INFO ] Deduced a trap composed of 109 places in 363 ms of which 2 ms to minimize.
[2025-05-29 18:29:14] [INFO ] Deduced a trap composed of 138 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:14] [INFO ] Deduced a trap composed of 121 places in 349 ms of which 2 ms to minimize.
[2025-05-29 18:29:14] [INFO ] Deduced a trap composed of 123 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:29:15] [INFO ] Deduced a trap composed of 122 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:29:15] [INFO ] Deduced a trap composed of 110 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:29:16] [INFO ] Deduced a trap composed of 130 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:29:16] [INFO ] Deduced a trap composed of 120 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:29:17] [INFO ] Deduced a trap composed of 107 places in 355 ms of which 3 ms to minimize.
[2025-05-29 18:29:17] [INFO ] Deduced a trap composed of 104 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:29:18] [INFO ] Deduced a trap composed of 98 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:29:19] [INFO ] Deduced a trap composed of 110 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:29:19] [INFO ] Deduced a trap composed of 69 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:29:19] [INFO ] Deduced a trap composed of 176 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:29:20] [INFO ] Deduced a trap composed of 136 places in 347 ms of which 2 ms to minimize.
[2025-05-29 18:29:20] [INFO ] Deduced a trap composed of 71 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:29:20] [INFO ] Deduced a trap composed of 101 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:21] [INFO ] Deduced a trap composed of 61 places in 352 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:29:26] [INFO ] Deduced a trap composed of 101 places in 360 ms of which 3 ms to minimize.
[2025-05-29 18:29:26] [INFO ] Deduced a trap composed of 81 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:29:28] [INFO ] Deduced a trap composed of 120 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:29:29] [INFO ] Deduced a trap composed of 186 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:29:29] [INFO ] Deduced a trap composed of 144 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:29:30] [INFO ] Deduced a trap composed of 163 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:29:30] [INFO ] Deduced a trap composed of 125 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:29:31] [INFO ] Deduced a trap composed of 112 places in 352 ms of which 2 ms to minimize.
[2025-05-29 18:29:31] [INFO ] Deduced a trap composed of 149 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:31] [INFO ] Deduced a trap composed of 134 places in 358 ms of which 2 ms to minimize.
[2025-05-29 18:29:32] [INFO ] Deduced a trap composed of 155 places in 361 ms of which 2 ms to minimize.
[2025-05-29 18:29:32] [INFO ] Deduced a trap composed of 127 places in 360 ms of which 3 ms to minimize.
[2025-05-29 18:29:32] [INFO ] Deduced a trap composed of 82 places in 412 ms of which 3 ms to minimize.
[2025-05-29 18:29:33] [INFO ] Deduced a trap composed of 98 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:29:33] [INFO ] Deduced a trap composed of 68 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:29:34] [INFO ] Deduced a trap composed of 105 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:29:34] [INFO ] Deduced a trap composed of 126 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:29:34] [INFO ] Deduced a trap composed of 88 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:35] [INFO ] Deduced a trap composed of 127 places in 368 ms of which 3 ms to minimize.
[2025-05-29 18:29:35] [INFO ] Deduced a trap composed of 146 places in 353 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/3347 variables, and 183 constraints, problems are : Problem set: 0 solved, 168 unsolved in 90022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/435 constraints, ReadFeed: 0/139 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 328/409 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 25/434 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:29:45] [INFO ] Deduced a trap composed of 69 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:29:45] [INFO ] Deduced a trap composed of 92 places in 355 ms of which 3 ms to minimize.
[2025-05-29 18:29:46] [INFO ] Deduced a trap composed of 71 places in 355 ms of which 4 ms to minimize.
[2025-05-29 18:29:46] [INFO ] Deduced a trap composed of 62 places in 356 ms of which 2 ms to minimize.
[2025-05-29 18:29:46] [INFO ] Deduced a trap composed of 56 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:29:47] [INFO ] Deduced a trap composed of 105 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:29:47] [INFO ] Deduced a trap composed of 128 places in 346 ms of which 2 ms to minimize.
[2025-05-29 18:29:48] [INFO ] Deduced a trap composed of 124 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:29:48] [INFO ] Deduced a trap composed of 118 places in 359 ms of which 2 ms to minimize.
[2025-05-29 18:29:49] [INFO ] Deduced a trap composed of 121 places in 360 ms of which 3 ms to minimize.
[2025-05-29 18:29:49] [INFO ] Deduced a trap composed of 106 places in 349 ms of which 2 ms to minimize.
[2025-05-29 18:29:50] [INFO ] Deduced a trap composed of 125 places in 351 ms of which 2 ms to minimize.
[2025-05-29 18:29:50] [INFO ] Deduced a trap composed of 85 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:29:52] [INFO ] Deduced a trap composed of 114 places in 367 ms of which 2 ms to minimize.
[2025-05-29 18:29:52] [INFO ] Deduced a trap composed of 91 places in 347 ms of which 3 ms to minimize.
[2025-05-29 18:29:53] [INFO ] Deduced a trap composed of 96 places in 354 ms of which 2 ms to minimize.
[2025-05-29 18:29:53] [INFO ] Deduced a trap composed of 99 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:29:53] [INFO ] Deduced a trap composed of 101 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:29:54] [INFO ] Deduced a trap composed of 98 places in 365 ms of which 3 ms to minimize.
[2025-05-29 18:29:54] [INFO ] Deduced a trap composed of 141 places in 356 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:30:08] [INFO ] Deduced a trap composed of 117 places in 368 ms of which 3 ms to minimize.
[2025-05-29 18:30:09] [INFO ] Deduced a trap composed of 94 places in 357 ms of which 2 ms to minimize.
[2025-05-29 18:30:09] [INFO ] Deduced a trap composed of 152 places in 364 ms of which 3 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 145 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 173 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 150 places in 367 ms of which 3 ms to minimize.
[2025-05-29 18:30:11] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 3 ms to minimize.
[2025-05-29 18:30:11] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:30:12] [INFO ] Deduced a trap composed of 111 places in 352 ms of which 3 ms to minimize.
[2025-05-29 18:30:12] [INFO ] Deduced a trap composed of 118 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:30:12] [INFO ] Deduced a trap composed of 158 places in 372 ms of which 3 ms to minimize.
[2025-05-29 18:30:13] [INFO ] Deduced a trap composed of 92 places in 349 ms of which 3 ms to minimize.
[2025-05-29 18:30:13] [INFO ] Deduced a trap composed of 137 places in 366 ms of which 3 ms to minimize.
[2025-05-29 18:30:14] [INFO ] Deduced a trap composed of 165 places in 363 ms of which 3 ms to minimize.
[2025-05-29 18:30:14] [INFO ] Deduced a trap composed of 126 places in 359 ms of which 3 ms to minimize.
[2025-05-29 18:30:14] [INFO ] Deduced a trap composed of 113 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:30:15] [INFO ] Deduced a trap composed of 111 places in 375 ms of which 3 ms to minimize.
[2025-05-29 18:30:15] [INFO ] Deduced a trap composed of 186 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:30:16] [INFO ] Deduced a trap composed of 150 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:30:16] [INFO ] Deduced a trap composed of 118 places in 349 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-05-29 18:30:53] [INFO ] Deduced a trap composed of 92 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:30:53] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 2 ms to minimize.
[2025-05-29 18:30:53] [INFO ] Deduced a trap composed of 192 places in 352 ms of which 3 ms to minimize.
[2025-05-29 18:30:54] [INFO ] Deduced a trap composed of 65 places in 353 ms of which 2 ms to minimize.
[2025-05-29 18:30:54] [INFO ] Deduced a trap composed of 77 places in 352 ms of which 2 ms to minimize.
[2025-05-29 18:30:54] [INFO ] Deduced a trap composed of 125 places in 355 ms of which 2 ms to minimize.
[2025-05-29 18:30:55] [INFO ] Deduced a trap composed of 120 places in 359 ms of which 3 ms to minimize.
[2025-05-29 18:30:55] [INFO ] Deduced a trap composed of 165 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:30:56] [INFO ] Deduced a trap composed of 114 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:30:56] [INFO ] Deduced a trap composed of 151 places in 357 ms of which 3 ms to minimize.
[2025-05-29 18:30:56] [INFO ] Deduced a trap composed of 188 places in 367 ms of which 2 ms to minimize.
[2025-05-29 18:30:57] [INFO ] Deduced a trap composed of 134 places in 347 ms of which 2 ms to minimize.
[2025-05-29 18:30:57] [INFO ] Deduced a trap composed of 135 places in 361 ms of which 3 ms to minimize.
[2025-05-29 18:30:57] [INFO ] Deduced a trap composed of 139 places in 359 ms of which 3 ms to minimize.
[2025-05-29 18:30:58] [INFO ] Deduced a trap composed of 133 places in 358 ms of which 3 ms to minimize.
[2025-05-29 18:30:58] [INFO ] Deduced a trap composed of 145 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:30:59] [INFO ] Deduced a trap composed of 159 places in 356 ms of which 3 ms to minimize.
[2025-05-29 18:30:59] [INFO ] Deduced a trap composed of 128 places in 351 ms of which 3 ms to minimize.
[2025-05-29 18:31:09] [INFO ] Deduced a trap composed of 109 places in 336 ms of which 2 ms to minimize.
[2025-05-29 18:31:09] [INFO ] Deduced a trap composed of 112 places in 356 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/3347 variables, and 243 constraints, problems are : Problem set: 0 solved, 168 unsolved in 90018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/435 constraints, ReadFeed: 0/139 constraints, PredecessorRefiner: 0/168 constraints, Known Traps: 220/220 constraints]
After SMT, in 180786ms problems are : Problem set: 0 solved, 168 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 2912/2912 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 369 transition count 2106
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 369 transition count 2106
Applied a total of 132 rules in 54 ms. Remains 369 /435 variables (removed 66) and now considering 2106/2912 (removed 806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 369/435 places, 2106/2912 transitions.
RANDOM walk for 4000000 steps (8 resets) in 67461 ms. (59 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40001 steps (8 resets) in 293 ms. (136 steps per ms) remains 167/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 314 ms. (126 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 379 ms. (105 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 353 ms. (112 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 307 ms. (129 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 302 ms. (132 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 472 ms. (84 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 324 ms. (123 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 329 ms. (121 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 362 ms. (110 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 336 ms. (118 steps per ms) remains 166/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 421 ms. (94 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (8 resets) in 398 ms. (100 steps per ms) remains 163/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 420 ms. (95 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 378 ms. (105 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 393 ms. (101 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 453 ms. (88 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 362 ms. (110 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40001 steps (8 resets) in 329 ms. (121 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40001 steps (8 resets) in 390 ms. (102 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 379 ms. (105 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 392 ms. (101 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 358 ms. (111 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 341 ms. (116 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 486 ms. (82 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 411 ms. (97 steps per ms) remains 162/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 305 ms. (130 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40000 steps (8 resets) in 499 ms. (80 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 361 ms. (110 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 338 ms. (117 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 438 ms. (91 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 390 ms. (102 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 337 ms. (118 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 405 ms. (98 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 302 ms. (132 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 340 ms. (117 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 375 ms. (106 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 424 ms. (94 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 396 ms. (100 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 255 ms. (156 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 346 ms. (115 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 337 ms. (118 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 161/162 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 475 ms. (84 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 296 ms. (134 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 270 ms. (147 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 405 ms. (98 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 402 ms. (99 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 421 ms. (94 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (8 resets) in 378 ms. (105 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (8 resets) in 484 ms. (82 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 357 ms. (111 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 454 ms. (87 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (8 resets) in 464 ms. (86 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 416 ms. (95 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 444 ms. (89 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 356 ms. (112 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40001 steps (8 resets) in 528 ms. (75 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 325 ms. (122 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 412 ms. (96 steps per ms) remains 159/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40002 steps (8 resets) in 404 ms. (98 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 446 ms. (89 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40002 steps (8 resets) in 213 ms. (186 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40001 steps (8 resets) in 434 ms. (91 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40002 steps (8 resets) in 455 ms. (87 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40002 steps (8 resets) in 398 ms. (100 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 155/159 properties
Interrupted probabilistic random walk after 4917368 steps, run timeout after 123001 ms. (steps per millisecond=39 ) properties seen :0 out of 155
Probabilistic random walk after 4917368 steps, saw 3518454 distinct states, run finished after 123022 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 2106 rows 369 cols
[2025-05-29 18:33:54] [INFO ] Computed 24 invariants in 13 ms
[2025-05-29 18:33:54] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 268/341 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 27/368 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 117 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 71 places in 359 ms of which 4 ms to minimize.
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 145 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 112 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:34:00] [INFO ] Deduced a trap composed of 77 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:34:00] [INFO ] Deduced a trap composed of 145 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:34:00] [INFO ] Deduced a trap composed of 101 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 86 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 132 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 135 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:03] [INFO ] Deduced a trap composed of 81 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:34:03] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:34:03] [INFO ] Deduced a trap composed of 104 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:34:03] [INFO ] Deduced a trap composed of 118 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:34:04] [INFO ] Deduced a trap composed of 92 places in 273 ms of which 5 ms to minimize.
[2025-05-29 18:34:04] [INFO ] Deduced a trap composed of 105 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:34:04] [INFO ] Deduced a trap composed of 94 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:05] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:34:05] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:34:05] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:34:05] [INFO ] Deduced a trap composed of 130 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:34:06] [INFO ] Deduced a trap composed of 114 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:06] [INFO ] Deduced a trap composed of 90 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:34:06] [INFO ] Deduced a trap composed of 114 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 113 places in 323 ms of which 3 ms to minimize.
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 92 places in 275 ms of which 3 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 125 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 80 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 182 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 132 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 147 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 117 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 135 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 124 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 132 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 116 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 109 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 3 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 92 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 132 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 111 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 124 places in 267 ms of which 3 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 90 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 135 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 93 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:34:24] [INFO ] Deduced a trap composed of 133 places in 273 ms of which 3 ms to minimize.
[2025-05-29 18:34:24] [INFO ] Deduced a trap composed of 110 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:34:24] [INFO ] Deduced a trap composed of 116 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:34:24] [INFO ] Deduced a trap composed of 115 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 147 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 139 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 90 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 114 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 107 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:27] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:34:27] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:27] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:28] [INFO ] Deduced a trap composed of 103 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:34:28] [INFO ] Deduced a trap composed of 82 places in 275 ms of which 3 ms to minimize.
[2025-05-29 18:34:28] [INFO ] Deduced a trap composed of 112 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:34:29] [INFO ] Deduced a trap composed of 79 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:34:29] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:34:29] [INFO ] Deduced a trap composed of 120 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:29] [INFO ] Deduced a trap composed of 92 places in 272 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:34:33] [INFO ] Deduced a trap composed of 109 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:34:33] [INFO ] Deduced a trap composed of 99 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:34:33] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:34:33] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:34:34] [INFO ] Deduced a trap composed of 104 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:34:34] [INFO ] Deduced a trap composed of 83 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:34:34] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:34:35] [INFO ] Deduced a trap composed of 108 places in 271 ms of which 3 ms to minimize.
[2025-05-29 18:34:35] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:34:36] [INFO ] Deduced a trap composed of 84 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:34:37] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:34:37] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:34:37] [INFO ] Deduced a trap composed of 100 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:37] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:34:38] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:34:39] [INFO ] Deduced a trap composed of 126 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:34:39] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:34:39] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:34:40] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:34:40] [INFO ] Deduced a trap composed of 110 places in 263 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (OVERLAPS) 2106/2475 variables, 369/493 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2475 variables, 110/603 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2475 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 15 (OVERLAPS) 0/2475 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2475/2475 variables, and 603 constraints, problems are : Problem set: 0 solved, 155 unsolved in 105013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 369/369 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 268/341 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 27/368 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:35:44] [INFO ] Deduced a trap composed of 123 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:35:44] [INFO ] Deduced a trap composed of 159 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:35:45] [INFO ] Deduced a trap composed of 125 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:35:45] [INFO ] Deduced a trap composed of 126 places in 276 ms of which 3 ms to minimize.
[2025-05-29 18:35:45] [INFO ] Deduced a trap composed of 129 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:35:45] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:35:46] [INFO ] Deduced a trap composed of 131 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:35:46] [INFO ] Deduced a trap composed of 115 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:35:46] [INFO ] Deduced a trap composed of 106 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:35:47] [INFO ] Deduced a trap composed of 124 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:35:47] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:35:47] [INFO ] Deduced a trap composed of 98 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:35:47] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:35:48] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:35:48] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:35:48] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:35:49] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:35:52] [INFO ] Deduced a trap composed of 76 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:35:52] [INFO ] Deduced a trap composed of 82 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:35:52] [INFO ] Deduced a trap composed of 123 places in 271 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 22/144 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:35:58] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 2106/2475 variables, 369/514 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2475 variables, 110/624 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2475 variables, 155/779 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2475 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2475/2475 variables, and 779 constraints, problems are : Problem set: 0 solved, 155 unsolved in 105017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 369/369 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 121/121 constraints]
After SMT, in 210456ms problems are : Problem set: 0 solved, 155 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 2106/2106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 365 transition count 2022
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 365 transition count 2022
Applied a total of 8 rules in 39 ms. Remains 365 /369 variables (removed 4) and now considering 2022/2106 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 365/369 places, 2022/2106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 45062 ms. (88 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 443 ms. (90 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 441 ms. (90 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 402 ms. (99 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 433 ms. (92 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 521 ms. (76 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 483 ms. (82 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 387 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 498 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 411 ms. (97 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 487 ms. (81 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 491 ms. (81 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 460 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 316 ms. (126 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 422 ms. (94 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 381 ms. (104 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 410 ms. (97 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 495 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 424 ms. (94 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 298 ms. (133 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 460 ms. (86 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 378 ms. (105 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 340 ms. (117 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 496 ms. (80 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 562 ms. (71 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 444 ms. (89 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 531 ms. (75 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 384 ms. (103 steps per ms) remains 155/155 properties
Interrupted probabilistic random walk after 2528784 steps, run timeout after 57001 ms. (steps per millisecond=44 ) properties seen :0 out of 155
Probabilistic random walk after 2528784 steps, saw 1798630 distinct states, run finished after 57002 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 2022 rows 365 cols
[2025-05-29 18:38:42] [INFO ] Computed 24 invariants in 7 ms
[2025-05-29 18:38:42] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 264/337 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 27/364 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 129 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 132 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 79 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:38:46] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:38:46] [INFO ] Deduced a trap composed of 129 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:38:46] [INFO ] Deduced a trap composed of 145 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:38:46] [INFO ] Deduced a trap composed of 106 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 102 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 129 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 109 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 130 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 94 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 53 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 131 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 121 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 163 places in 248 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 127 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 100 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:38:53] [INFO ] Deduced a trap composed of 77 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:38:53] [INFO ] Deduced a trap composed of 78 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:38:53] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:38:54] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:38:54] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:38:54] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:38:55] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:38:55] [INFO ] Deduced a trap composed of 87 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:38:55] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:38:56] [INFO ] Deduced a trap composed of 81 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:38:56] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:38:56] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:38:56] [INFO ] Deduced a trap composed of 96 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:38:57] [INFO ] Deduced a trap composed of 100 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:38:57] [INFO ] Deduced a trap composed of 114 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:38:57] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:38:57] [INFO ] Deduced a trap composed of 115 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 124 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 151 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 136 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 132 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 125 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 117 places in 256 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 109 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 154 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 143 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 104 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 118 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 79 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:39:06] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:39:07] [INFO ] Deduced a trap composed of 114 places in 270 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:39:13] [INFO ] Deduced a trap composed of 104 places in 261 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:39:15] [INFO ] Deduced a trap composed of 87 places in 266 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 2022/2387 variables, 365/453 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2387 variables, 110/563 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2387 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 16 (OVERLAPS) 0/2387 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2387/2387 variables, and 563 constraints, problems are : Problem set: 0 solved, 155 unsolved in 69521 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 264/337 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 27/364 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 62/85 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:39:54] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:39:54] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:39:55] [INFO ] Deduced a trap composed of 112 places in 279 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:39:58] [INFO ] Deduced a trap composed of 90 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 87 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 112 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 141 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 124 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 111 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 110 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 131 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 129 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 128 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 98 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:40:09] [INFO ] Deduced a trap composed of 95 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:40:09] [INFO ] Deduced a trap composed of 96 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:40:09] [INFO ] Deduced a trap composed of 107 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:40:11] [INFO ] Deduced a trap composed of 87 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:40:11] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 3 ms to minimize.
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 97 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:40:15] [INFO ] Deduced a trap composed of 95 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:40:15] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:40:15] [INFO ] Deduced a trap composed of 80 places in 247 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:20] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:40:20] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:40:21] [INFO ] Deduced a trap composed of 53 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:40:21] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 3 ms to minimize.
[2025-05-29 18:40:21] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:40:22] [INFO ] Deduced a trap composed of 117 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:40:22] [INFO ] Deduced a trap composed of 100 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:40:22] [INFO ] Deduced a trap composed of 122 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:40:23] [INFO ] Deduced a trap composed of 107 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:40:23] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 10/132 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 1/365 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:44] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:40:45] [INFO ] Deduced a trap composed of 78 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:40:46] [INFO ] Deduced a trap composed of 111 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:40:46] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:40:47] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:40:47] [INFO ] Deduced a trap composed of 99 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:40:47] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:40:48] [INFO ] Deduced a trap composed of 119 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:40:48] [INFO ] Deduced a trap composed of 71 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:40:48] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:40:48] [INFO ] Deduced a trap composed of 123 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:40:49] [INFO ] Deduced a trap composed of 126 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:40:49] [INFO ] Deduced a trap composed of 125 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:40:49] [INFO ] Deduced a trap composed of 127 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:40:50] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:40:50] [INFO ] Deduced a trap composed of 112 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:40:50] [INFO ] Deduced a trap composed of 103 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:40:50] [INFO ] Deduced a trap composed of 147 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:40:51] [INFO ] Deduced a trap composed of 149 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:40:51] [INFO ] Deduced a trap composed of 119 places in 251 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:54] [INFO ] Deduced a trap composed of 101 places in 268 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2025-05-29 18:40:56] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:40:57] [INFO ] Deduced a trap composed of 100 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:40:57] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:40:58] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 98 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 94 places in 285 ms of which 3 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 113 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 91 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 106 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 108 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 128 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 124 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 135 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:41:03] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:41:03] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 17 (OVERLAPS) 2022/2387 variables, 365/541 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2387 variables, 110/651 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2387 variables, 155/806 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2387/2387 variables, and 806 constraints, problems are : Problem set: 0 solved, 155 unsolved in 120019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 152/152 constraints]
After SMT, in 189969ms problems are : Problem set: 0 solved, 155 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 2022/2022 transitions.
Applied a total of 0 rules in 26 ms. Remains 365 /365 variables (removed 0) and now considering 2022/2022 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 365/365 places, 2022/2022 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 2022/2022 transitions.
Applied a total of 0 rules in 23 ms. Remains 365 /365 variables (removed 0) and now considering 2022/2022 (removed 0) transitions.
[2025-05-29 18:41:52] [INFO ] Invariant cache hit.
[2025-05-29 18:41:52] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-05-29 18:41:52] [INFO ] Invariant cache hit.
[2025-05-29 18:41:52] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 18:41:54] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2025-05-29 18:41:54] [INFO ] Redundant transitions in 103 ms returned []
Running 2011 sub problems to find dead transitions.
[2025-05-29 18:41:54] [INFO ] Invariant cache hit.
[2025-05-29 18:41:54] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2025-05-29 18:42:12] [INFO ] Deduced a trap composed of 124 places in 284 ms of which 3 ms to minimize.
[2025-05-29 18:42:12] [INFO ] Deduced a trap composed of 125 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:42:13] [INFO ] Deduced a trap composed of 107 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:42:13] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:42:13] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:42:14] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:42:14] [INFO ] Deduced a trap composed of 115 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:42:14] [INFO ] Deduced a trap composed of 132 places in 280 ms of which 3 ms to minimize.
[2025-05-29 18:42:15] [INFO ] Deduced a trap composed of 63 places in 289 ms of which 2 ms to minimize.
[2025-05-29 18:42:15] [INFO ] Deduced a trap composed of 84 places in 293 ms of which 3 ms to minimize.
[2025-05-29 18:42:15] [INFO ] Deduced a trap composed of 88 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 3 ms to minimize.
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 116 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:42:17] [INFO ] Deduced a trap composed of 77 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:42:17] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:42:17] [INFO ] Deduced a trap composed of 109 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:42:17] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 77 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 97 places in 259 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2025-05-29 18:42:19] [INFO ] Deduced a trap composed of 95 places in 289 ms of which 2 ms to minimize.
[2025-05-29 18:42:20] [INFO ] Deduced a trap composed of 161 places in 273 ms of which 3 ms to minimize.
[2025-05-29 18:42:20] [INFO ] Deduced a trap composed of 118 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:42:20] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:42:21] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:42:21] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:42:21] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:42:21] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:42:22] [INFO ] Deduced a trap composed of 77 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:42:22] [INFO ] Deduced a trap composed of 91 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:42:22] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:42:23] [INFO ] Deduced a trap composed of 98 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:42:23] [INFO ] Deduced a trap composed of 116 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:42:23] [INFO ] Deduced a trap composed of 100 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 133 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 102 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 89 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 137 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 138 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 116 places in 284 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/2387 variables, and 64 constraints, problems are : Problem set: 0 solved, 2011 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 2011/2011 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2011 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 63 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 170 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 103 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 71 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 91 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 82 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 76 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 105 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:42:38] [INFO ] Deduced a trap composed of 102 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:42:38] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:42:38] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:42:38] [INFO ] Deduced a trap composed of 81 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 172 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:42:42] [INFO ] Deduced a trap composed of 169 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:42:42] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:42:42] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:42:43] [INFO ] Deduced a trap composed of 91 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:42:43] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:42:43] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:42:43] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 123 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 81 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 84 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 111 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 93 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 111 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 91 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:42:47] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2025-05-29 18:42:52] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:42:52] [INFO ] Deduced a trap composed of 101 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:42:52] [INFO ] Deduced a trap composed of 93 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:42:52] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:42:53] [INFO ] Deduced a trap composed of 115 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:42:53] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 130 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 99 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 123 places in 258 ms of which 3 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 128 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 186 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 122 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 2 ms to minimize.
[2025-05-29 18:42:57] [INFO ] Deduced a trap composed of 99 places in 258 ms of which 3 ms to minimize.
[2025-05-29 18:42:57] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:42:58] [INFO ] Deduced a trap composed of 184 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:42:58] [INFO ] Deduced a trap composed of 111 places in 252 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/2387 variables, and 124 constraints, problems are : Problem set: 0 solved, 2011 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/2011 constraints, Known Traps: 100/100 constraints]
After SMT, in 65194ms problems are : Problem set: 0 solved, 2011 unsolved
Search for dead transitions found 0 dead transitions in 65214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67606 ms. Remains : 365/365 places, 2022/2022 transitions.
RANDOM walk for 400000 steps (8 resets) in 3221 ms. (124 steps per ms) remains 2/73 properties
Running SMT prover for 2 properties.
[2025-05-29 18:43:00] [INFO ] Invariant cache hit.
[2025-05-29 18:43:00] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 18:43:00] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2025-05-29 18:43:01] [INFO ] After 656ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-29 18:43:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 18:43:01] [INFO ] After 210ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 18:43:01] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 18:43:01] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 18:43:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-29 18:43:01] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 10 ms returned sat
[2025-05-29 18:43:02] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-29 18:43:02] [INFO ] After 168ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 18:43:03] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 18:43:03] [INFO ] After 1230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 3239782 steps (8 resets) in 120004 ms. (26 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 153/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 435 ms. (91 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 576 ms. (69 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 491 ms. (81 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 577 ms. (69 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 387 ms. (103 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 584 ms. (68 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 469 ms. (85 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 505 ms. (79 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 152/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 611 ms. (65 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 625 ms. (63 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 567 ms. (70 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 818 ms. (48 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 621 ms. (64 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (8 resets) in 628 ms. (63 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 532 ms. (75 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 618 ms. (64 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 605 ms. (66 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (8 resets) in 639 ms. (62 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 717 ms. (55 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (8 resets) in 597 ms. (66 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 726 ms. (55 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 520 ms. (76 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 575 ms. (69 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 604 ms. (66 steps per ms) remains 151/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 794 ms. (50 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 555 ms. (71 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 558 ms. (71 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 654 ms. (61 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 554 ms. (72 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 514 ms. (77 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 478 ms. (83 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 428 ms. (93 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40001 steps (8 resets) in 486 ms. (82 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 539 ms. (74 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 736 ms. (54 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40001 steps (8 resets) in 568 ms. (70 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 539 ms. (74 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 538 ms. (74 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 470 ms. (84 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 571 ms. (69 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 596 ms. (67 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 562 ms. (71 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 478 ms. (83 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 541 ms. (73 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 561 ms. (71 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 562 ms. (71 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 646 ms. (61 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 739 ms. (54 steps per ms) remains 151/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 820 ms. (48 steps per ms) remains 149/151 properties
BEST_FIRST walk for 40002 steps (8 resets) in 490 ms. (81 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40001 steps (8 resets) in 445 ms. (89 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 414 ms. (96 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 361 ms. (110 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 647 ms. (61 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 486 ms. (82 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40001 steps (8 resets) in 584 ms. (68 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 643 ms. (62 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 558 ms. (71 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 658 ms. (60 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 501 ms. (79 steps per ms) remains 145/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 467 ms. (85 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (8 resets) in 494 ms. (80 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (8 resets) in 538 ms. (74 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (8 resets) in 549 ms. (72 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (8 resets) in 550 ms. (72 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40001 steps (8 resets) in 759 ms. (52 steps per ms) remains 143/145 properties
BEST_FIRST walk for 40003 steps (8 resets) in 656 ms. (60 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 610 ms. (65 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 572 ms. (69 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 576 ms. (69 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 596 ms. (67 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 494 ms. (80 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 609 ms. (65 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 597 ms. (66 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 635 ms. (62 steps per ms) remains 141/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 522 ms. (76 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 603 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 559 ms. (71 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 698 ms. (57 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 583 ms. (68 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 583 ms. (68 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 580 ms. (68 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 656 ms. (60 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 598 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 766 ms. (52 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 517 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40000 steps (8 resets) in 513 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 581 ms. (68 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 493 ms. (80 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 473 ms. (84 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 604 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 547 ms. (72 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 571 ms. (69 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 631 ms. (63 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 472 ms. (84 steps per ms) remains 141/141 properties
Interrupted probabilistic random walk after 6662563 steps, run timeout after 168001 ms. (steps per millisecond=39 ) properties seen :0 out of 141
Probabilistic random walk after 6662563 steps, saw 4662202 distinct states, run finished after 168001 ms. (steps per millisecond=39 ) properties seen :0
[2025-05-29 18:46:47] [INFO ] Invariant cache hit.
[2025-05-29 18:46:47] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 266/337 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 27/364 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:46:50] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 4 ms to minimize.
[2025-05-29 18:46:50] [INFO ] Deduced a trap composed of 93 places in 301 ms of which 2 ms to minimize.
[2025-05-29 18:46:51] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 3 ms to minimize.
[2025-05-29 18:46:51] [INFO ] Deduced a trap composed of 63 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:46:51] [INFO ] Deduced a trap composed of 150 places in 289 ms of which 3 ms to minimize.
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 106 places in 296 ms of which 2 ms to minimize.
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 116 places in 306 ms of which 2 ms to minimize.
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 107 places in 289 ms of which 2 ms to minimize.
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 111 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 151 places in 362 ms of which 3 ms to minimize.
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 95 places in 297 ms of which 3 ms to minimize.
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 144 places in 337 ms of which 3 ms to minimize.
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 121 places in 296 ms of which 2 ms to minimize.
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 152 places in 299 ms of which 2 ms to minimize.
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 129 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 104 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 158 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 146 places in 293 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:46:57] [INFO ] Deduced a trap composed of 116 places in 298 ms of which 4 ms to minimize.
[2025-05-29 18:46:57] [INFO ] Deduced a trap composed of 116 places in 298 ms of which 2 ms to minimize.
[2025-05-29 18:46:57] [INFO ] Deduced a trap composed of 98 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:46:58] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:46:59] [INFO ] Deduced a trap composed of 138 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:46:59] [INFO ] Deduced a trap composed of 129 places in 267 ms of which 3 ms to minimize.
[2025-05-29 18:46:59] [INFO ] Deduced a trap composed of 91 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:46:59] [INFO ] Deduced a trap composed of 125 places in 283 ms of which 3 ms to minimize.
[2025-05-29 18:47:00] [INFO ] Deduced a trap composed of 140 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 101 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 140 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 91 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 111 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 131 places in 293 ms of which 3 ms to minimize.
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 138 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 105 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:47:03] [INFO ] Deduced a trap composed of 155 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:47:03] [INFO ] Deduced a trap composed of 87 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:47:03] [INFO ] Deduced a trap composed of 73 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:47:03] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:04] [INFO ] Deduced a trap composed of 55 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:47:05] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:47:05] [INFO ] Deduced a trap composed of 84 places in 285 ms of which 3 ms to minimize.
[2025-05-29 18:47:05] [INFO ] Deduced a trap composed of 116 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:47:05] [INFO ] Deduced a trap composed of 87 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:47:06] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:47:06] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:47:06] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:47:07] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:47:07] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:07] [INFO ] Deduced a trap composed of 118 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:47:07] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:47:08] [INFO ] Deduced a trap composed of 79 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:47:08] [INFO ] Deduced a trap composed of 121 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:47:08] [INFO ] Deduced a trap composed of 89 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:47:08] [INFO ] Deduced a trap composed of 112 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:47:09] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:12] [INFO ] Deduced a trap composed of 60 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:47:12] [INFO ] Deduced a trap composed of 84 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:47:12] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:47:13] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:47:13] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 113 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 94 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 105 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 117 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 125 places in 256 ms of which 3 ms to minimize.
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 3 ms to minimize.
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 130 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 132 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:47:17] [INFO ] Deduced a trap composed of 93 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:47:17] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:47:17] [INFO ] Deduced a trap composed of 141 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:47:18] [INFO ] Deduced a trap composed of 152 places in 249 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 129 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:47:20] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:20] [INFO ] Deduced a trap composed of 148 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:47:20] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:47:20] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:47:21] [INFO ] Deduced a trap composed of 75 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:47:21] [INFO ] Deduced a trap composed of 111 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 81 places in 260 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:29] [INFO ] Deduced a trap composed of 161 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:47:29] [INFO ] Deduced a trap composed of 147 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:47:29] [INFO ] Deduced a trap composed of 146 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:47:30] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:47:30] [INFO ] Deduced a trap composed of 84 places in 256 ms of which 3 ms to minimize.
[2025-05-29 18:47:30] [INFO ] Deduced a trap composed of 131 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:47:31] [INFO ] Deduced a trap composed of 99 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:47:31] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:47:31] [INFO ] Deduced a trap composed of 92 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:47:31] [INFO ] Deduced a trap composed of 106 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 147 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 150 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 140 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:47:33] [INFO ] Deduced a trap composed of 109 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:47:33] [INFO ] Deduced a trap composed of 141 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:47:33] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:47:34] [INFO ] Deduced a trap composed of 118 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:47:34] [INFO ] Deduced a trap composed of 88 places in 279 ms of which 3 ms to minimize.
[2025-05-29 18:47:34] [INFO ] Deduced a trap composed of 79 places in 266 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:36] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:47:36] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:47:36] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:47:37] [INFO ] Deduced a trap composed of 101 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:47:37] [INFO ] Deduced a trap composed of 79 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:47:37] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 3 ms to minimize.
[2025-05-29 18:47:38] [INFO ] Deduced a trap composed of 101 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:47:38] [INFO ] Deduced a trap composed of 98 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:47:38] [INFO ] Deduced a trap composed of 98 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:47:39] [INFO ] Deduced a trap composed of 103 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:39] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:47:40] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:40] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:47:40] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:47:40] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:47:41] [INFO ] Deduced a trap composed of 92 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:47:41] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:47:41] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 3 ms to minimize.
[2025-05-29 18:47:41] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:47:42] [INFO ] Deduced a trap composed of 87 places in 260 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 88 places in 267 ms of which 3 ms to minimize.
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 60 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 85 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:47:48] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:47:48] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:47:48] [INFO ] Deduced a trap composed of 96 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 94 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 80 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:47:51] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:47:51] [INFO ] Deduced a trap composed of 70 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:47:51] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:47:51] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:47:52] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:47:56] [INFO ] Deduced a trap composed of 129 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:47:57] [INFO ] Deduced a trap composed of 86 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:47:57] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:47:57] [INFO ] Deduced a trap composed of 95 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:47:57] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:47:58] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:47:58] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:47:59] [INFO ] Deduced a trap composed of 118 places in 277 ms of which 3 ms to minimize.
[2025-05-29 18:47:59] [INFO ] Deduced a trap composed of 87 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:48:00] [INFO ] Deduced a trap composed of 102 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:48:01] [INFO ] Deduced a trap composed of 63 places in 277 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 16 (OVERLAPS) 2022/2387 variables, 365/548 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2387 variables, 110/658 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2387 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 19 (OVERLAPS) 0/2387 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2387/2387 variables, and 658 constraints, problems are : Problem set: 0 solved, 141 unsolved in 132613 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 266/337 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 27/364 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 157/180 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:49:03] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:49:03] [INFO ] Deduced a trap composed of 148 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:49:04] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:49:04] [INFO ] Deduced a trap composed of 142 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:49:04] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:49:04] [INFO ] Deduced a trap composed of 73 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:49:05] [INFO ] Deduced a trap composed of 115 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:49:05] [INFO ] Deduced a trap composed of 123 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:49:06] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 3 ms to minimize.
[2025-05-29 18:49:06] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:49:06] [INFO ] Deduced a trap composed of 94 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:49:07] [INFO ] Deduced a trap composed of 135 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:49:07] [INFO ] Deduced a trap composed of 152 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:49:07] [INFO ] Deduced a trap composed of 84 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:49:07] [INFO ] Deduced a trap composed of 146 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:49:08] [INFO ] Deduced a trap composed of 181 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:49:08] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:49:08] [INFO ] Deduced a trap composed of 98 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:49:08] [INFO ] Deduced a trap composed of 101 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:49:09] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:49:12] [INFO ] Deduced a trap composed of 120 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:49:12] [INFO ] Deduced a trap composed of 109 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:49:13] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:49:15] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:49:15] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:49:15] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:49:16] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:49:16] [INFO ] Deduced a trap composed of 94 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:49:16] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:49:20] [INFO ] Deduced a trap composed of 107 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:49:20] [INFO ] Deduced a trap composed of 71 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 88 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:49:22] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:49:22] [INFO ] Deduced a trap composed of 88 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:49:22] [INFO ] Deduced a trap composed of 137 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:49:22] [INFO ] Deduced a trap composed of 135 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:49:23] [INFO ] Deduced a trap composed of 113 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:49:23] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:49:23] [INFO ] Deduced a trap composed of 106 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:49:23] [INFO ] Deduced a trap composed of 125 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:49:24] [INFO ] Deduced a trap composed of 104 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:49:24] [INFO ] Deduced a trap composed of 128 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:49:24] [INFO ] Deduced a trap composed of 117 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:49:25] [INFO ] Deduced a trap composed of 74 places in 303 ms of which 2 ms to minimize.
[2025-05-29 18:49:25] [INFO ] Deduced a trap composed of 80 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:49:25] [INFO ] Deduced a trap composed of 89 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:49:25] [INFO ] Deduced a trap composed of 117 places in 252 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-29 18:49:35] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 2022/2387 variables, 365/598 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2387 variables, 110/708 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2387 variables, 141/849 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2387 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2387/2387 variables, and 849 constraints, problems are : Problem set: 0 solved, 141 unsolved in 135013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 209/209 constraints]
After SMT, in 268163ms problems are : Problem set: 0 solved, 141 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 2022/2022 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 363 transition count 1980
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 363 transition count 1980
Applied a total of 4 rules in 36 ms. Remains 363 /365 variables (removed 2) and now considering 1980/2022 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 363/365 places, 1980/2022 transitions.
RANDOM walk for 3326365 steps (8 resets) in 120004 ms. (27 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40000 steps (8 resets) in 521 ms. (76 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 571 ms. (69 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 512 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 579 ms. (68 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 472 ms. (84 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40000 steps (8 resets) in 523 ms. (76 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 462 ms. (86 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 518 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 591 ms. (67 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 618 ms. (64 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 445 ms. (89 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 615 ms. (64 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 513 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 573 ms. (69 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 605 ms. (66 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 504 ms. (79 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 486 ms. (82 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 575 ms. (69 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 524 ms. (76 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 638 ms. (62 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 361 ms. (110 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 478 ms. (83 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 415 ms. (96 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 138/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 612 ms. (65 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 523 ms. (76 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 505 ms. (79 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 421 ms. (94 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 521 ms. (76 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 528 ms. (75 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 424 ms. (94 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 484 ms. (82 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 587 ms. (68 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 440 ms. (90 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 522 ms. (76 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 611 ms. (65 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 486 ms. (82 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 600 ms. (66 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 634 ms. (62 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 263 ms. (151 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 463 ms. (86 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 503 ms. (79 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 506 ms. (78 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 470 ms. (84 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 518 ms. (77 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 411 ms. (97 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 486 ms. (82 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 620 ms. (64 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 482 ms. (82 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 524 ms. (76 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 747 ms. (53 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 493 ms. (80 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 361 ms. (110 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 380 ms. (104 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 495 ms. (80 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 555 ms. (71 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 477 ms. (83 steps per ms) remains 138/138 properties
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Anderson-PT-11"
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 Anderson-PT-11, 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 r014-tall-174853743400127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 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 '
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 ;