About the Execution of 2024-gold for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15691.900 | 1800000.00 | 4017386.00 | 2528.30 | [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-174853743400122.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-10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K 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.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748542589091
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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:16:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:16:30] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2025-05-29 18:16:30] [INFO ] Transformed 621 places.
[2025-05-29 18:16:30] [INFO ] Transformed 2480 transitions.
[2025-05-29 18:16:30] [INFO ] Found NUPN structural information;
[2025-05-29 18:16:30] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 417 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 20 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 101 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2025-05-29 18:16:31] [INFO ] Computed 23 invariants in 75 ms
[2025-05-29 18:16:32] [INFO ] Implicit Places using invariants in 1901 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1943 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 23 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2025-05-29 18:16:32] [INFO ] Computed 22 invariants in 19 ms
[2025-05-29 18:16:33] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2025-05-29 18:16:33] [INFO ] Invariant cache hit.
[2025-05-29 18:16:34] [INFO ] State equation strengthened by 170 read => feed constraints.
[2025-05-29 18:16:37] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 4700 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6797 ms. Remains : 430/621 places, 2290/2480 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 4484 ms. (8 steps per ms) remains 1188/2280 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1188/1188 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1188/1188 properties
[2025-05-29 18:16:39] [INFO ] Invariant cache hit.
[2025-05-29 18:16:39] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/2720 variables, and 191 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 5076 ms.
Refiners :[Domain max(s): 190/430 constraints, Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 1/11 constraints, State Equation: 0/430 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/2720 variables, and 191 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 5043 ms.
Refiners :[Domain max(s): 190/430 constraints, Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 1/11 constraints, State Equation: 0/430 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 0/0 constraints]
After SMT, in 14152ms problems are : Problem set: 0 solved, 1188 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 2290/2290 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 394 transition count 2254
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 394 transition count 2254
Applied a total of 72 rules in 235 ms. Remains 394 /430 variables (removed 36) and now considering 2254/2290 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 394/430 places, 2254/2290 transitions.
RANDOM walk for 1444970 steps (4 resets) in 120004 ms. (12 steps per ms) remains 615/1188 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 614/615 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 613/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 607/613 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 606/607 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 604/606 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 505/604 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 504/505 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 504/504 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 504/504 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 504/504 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 410/504 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 410/410 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 410/410 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 410/410 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 409/410 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 406/409 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 398/406 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 398/398 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 397/398 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 397/397 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 397/397 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 392/397 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 385/392 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 385/385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 385/385 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 385/385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 385/385 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 377/385 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 377/377 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 367/377 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 364/367 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 363/364 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 363/363 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 363/363 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 363/363 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 363/363 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 362/363 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 362/362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 357/362 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 357/357 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 344/357 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 338/344 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 319/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 307/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 307/307 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 297/307 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 297/297 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 294/297 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 294/294 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 289/294 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 289/289 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 288/289 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 288/288 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 275/288 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 275/275 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 275/275 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 274/275 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 271/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 271/271 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 262/271 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 262/262 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 262/262 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 261/262 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 253/261 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 251/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 249/251 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 249/249 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 240/249 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 236/240 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 225/236 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 225/225 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 225/225 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 225/225 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 225/225 properties
// Phase 1: matrix 2254 rows 394 cols
[2025-05-29 18:17:29] [INFO ] Computed 22 invariants in 9 ms
[2025-05-29 18:17:29] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 282/381 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 22 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 289 places in 335 ms of which 7 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 250 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 250 places in 282 ms of which 12 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 3 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 251 places in 279 ms of which 5 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 212 places in 358 ms of which 2 ms to minimize.
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 288 places in 430 ms of which 5 ms to minimize.
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 269 places in 492 ms of which 4 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 2 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 250 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 3 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 250 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 250 places in 218 ms of which 3 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 231 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 231 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 250 places in 232 ms of which 2 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 231 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:17:41] [INFO ] Deduced a trap composed of 289 places in 216 ms of which 3 ms to minimize.
[2025-05-29 18:17:41] [INFO ] Deduced a trap composed of 256 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:17:41] [INFO ] Deduced a trap composed of 231 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:17:42] [INFO ] Deduced a trap composed of 273 places in 208 ms of which 3 ms to minimize.
[2025-05-29 18:17:42] [INFO ] Deduced a trap composed of 256 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:17:42] [INFO ] Deduced a trap composed of 257 places in 192 ms of which 3 ms to minimize.
[2025-05-29 18:17:42] [INFO ] Deduced a trap composed of 236 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:17:42] [INFO ] Deduced a trap composed of 236 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:17:43] [INFO ] Deduced a trap composed of 275 places in 199 ms of which 6 ms to minimize.
[2025-05-29 18:17:43] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:17:43] [INFO ] Deduced a trap composed of 235 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:17:43] [INFO ] Deduced a trap composed of 254 places in 204 ms of which 3 ms to minimize.
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 274 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 275 places in 222 ms of which 3 ms to minimize.
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 251 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 253 places in 217 ms of which 3 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 234 places in 193 ms of which 6 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 238 places in 209 ms of which 3 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 253 places in 209 ms of which 3 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 236 places in 206 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:17:48] [INFO ] Deduced a trap composed of 235 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:17:49] [INFO ] Deduced a trap composed of 252 places in 196 ms of which 4 ms to minimize.
[2025-05-29 18:17:49] [INFO ] Deduced a trap composed of 216 places in 220 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:17:52] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:17:52] [INFO ] Deduced a trap composed of 216 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:17:52] [INFO ] Deduced a trap composed of 272 places in 198 ms of which 3 ms to minimize.
[2025-05-29 18:17:53] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:17:53] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 3 ms to minimize.
[2025-05-29 18:17:53] [INFO ] Deduced a trap composed of 258 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:17:53] [INFO ] Deduced a trap composed of 258 places in 201 ms of which 3 ms to minimize.
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 256 places in 206 ms of which 3 ms to minimize.
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 214 places in 190 ms of which 3 ms to minimize.
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 3 ms to minimize.
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 213 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 251 places in 184 ms of which 2 ms to minimize.
[2025-05-29 18:17:55] [INFO ] Deduced a trap composed of 237 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:17:55] [INFO ] Deduced a trap composed of 241 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:17:55] [INFO ] Deduced a trap composed of 225 places in 196 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:17:58] [INFO ] Deduced a trap composed of 257 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:17:58] [INFO ] Deduced a trap composed of 248 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:17:58] [INFO ] Deduced a trap composed of 239 places in 222 ms of which 3 ms to minimize.
[2025-05-29 18:17:58] [INFO ] Deduced a trap composed of 233 places in 188 ms of which 2 ms to minimize.
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 215 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 243 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 246 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 235 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 198 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 256 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 234 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 235 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 219 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:18:01] [INFO ] Deduced a trap composed of 208 places in 234 ms of which 3 ms to minimize.
[2025-05-29 18:18:01] [INFO ] Deduced a trap composed of 219 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:18:01] [INFO ] Deduced a trap composed of 229 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:18:01] [INFO ] Deduced a trap composed of 213 places in 201 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 222 places in 189 ms of which 2 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 3 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 3 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 219 places in 204 ms of which 3 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 239 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 3 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 216 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 202 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 204 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 197 places in 204 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:11] [INFO ] Deduced a trap composed of 223 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:18:11] [INFO ] Deduced a trap composed of 232 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:18:11] [INFO ] Deduced a trap composed of 218 places in 205 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/2648 variables, and 101 constraints, problems are : Problem set: 0 solved, 225 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/394 constraints, ReadFeed: 0/144 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 282/381 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 13/394 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:19] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 2 ms to minimize.
[2025-05-29 18:18:19] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 2 ms to minimize.
[2025-05-29 18:18:20] [INFO ] Deduced a trap composed of 151 places in 305 ms of which 2 ms to minimize.
[2025-05-29 18:18:20] [INFO ] Deduced a trap composed of 120 places in 303 ms of which 3 ms to minimize.
[2025-05-29 18:18:20] [INFO ] Deduced a trap composed of 97 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 103 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 78 places in 367 ms of which 4 ms to minimize.
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 139 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:18:22] [INFO ] Deduced a trap composed of 152 places in 296 ms of which 2 ms to minimize.
[2025-05-29 18:18:22] [INFO ] Deduced a trap composed of 126 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:18:22] [INFO ] Deduced a trap composed of 115 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:18:23] [INFO ] Deduced a trap composed of 117 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:18:23] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:18:23] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 2 ms to minimize.
[2025-05-29 18:18:24] [INFO ] Deduced a trap composed of 81 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:18:24] [INFO ] Deduced a trap composed of 89 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:18:24] [INFO ] Deduced a trap composed of 102 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:18:25] [INFO ] Deduced a trap composed of 91 places in 298 ms of which 2 ms to minimize.
[2025-05-29 18:18:25] [INFO ] Deduced a trap composed of 73 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:18:25] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 109 places in 326 ms of which 2 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 95 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:18:35] [INFO ] Deduced a trap composed of 76 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:18:35] [INFO ] Deduced a trap composed of 154 places in 295 ms of which 2 ms to minimize.
[2025-05-29 18:18:35] [INFO ] Deduced a trap composed of 172 places in 306 ms of which 2 ms to minimize.
[2025-05-29 18:18:35] [INFO ] Deduced a trap composed of 73 places in 294 ms of which 3 ms to minimize.
[2025-05-29 18:18:36] [INFO ] Deduced a trap composed of 118 places in 308 ms of which 2 ms to minimize.
[2025-05-29 18:18:36] [INFO ] Deduced a trap composed of 141 places in 303 ms of which 2 ms to minimize.
[2025-05-29 18:18:36] [INFO ] Deduced a trap composed of 76 places in 309 ms of which 2 ms to minimize.
[2025-05-29 18:18:37] [INFO ] Deduced a trap composed of 154 places in 332 ms of which 3 ms to minimize.
[2025-05-29 18:18:37] [INFO ] Deduced a trap composed of 174 places in 303 ms of which 2 ms to minimize.
[2025-05-29 18:18:37] [INFO ] Deduced a trap composed of 143 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:18:38] [INFO ] Deduced a trap composed of 158 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:18:38] [INFO ] Deduced a trap composed of 134 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:18:38] [INFO ] Deduced a trap composed of 115 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:18:39] [INFO ] Deduced a trap composed of 141 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:18:39] [INFO ] Deduced a trap composed of 153 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:18:39] [INFO ] Deduced a trap composed of 178 places in 311 ms of which 3 ms to minimize.
[2025-05-29 18:18:40] [INFO ] Deduced a trap composed of 128 places in 306 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2025-05-29 18:18:56] [INFO ] Deduced a trap composed of 142 places in 304 ms of which 3 ms to minimize.
[2025-05-29 18:18:57] [INFO ] Deduced a trap composed of 140 places in 312 ms of which 2 ms to minimize.
[2025-05-29 18:18:57] [INFO ] Deduced a trap composed of 91 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:18:57] [INFO ] Deduced a trap composed of 140 places in 309 ms of which 2 ms to minimize.
[2025-05-29 18:18:58] [INFO ] Deduced a trap composed of 188 places in 312 ms of which 2 ms to minimize.
[2025-05-29 18:18:58] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:18:59] [INFO ] Deduced a trap composed of 144 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:18:59] [INFO ] Deduced a trap composed of 110 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:18:59] [INFO ] Deduced a trap composed of 124 places in 311 ms of which 3 ms to minimize.
[2025-05-29 18:19:00] [INFO ] Deduced a trap composed of 162 places in 313 ms of which 2 ms to minimize.
[2025-05-29 18:19:00] [INFO ] Deduced a trap composed of 178 places in 324 ms of which 3 ms to minimize.
SMT process timed out in 91239ms, After SMT, problems are : Problem set: 0 solved, 225 unsolved
Fused 225 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 99 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2254/2254 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 338 transition count 2090
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 338 transition count 2090
Applied a total of 112 rules in 69 ms. Remains 338 /394 variables (removed 56) and now considering 2090/2254 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 338/394 places, 2090/2254 transitions.
RANDOM walk for 4000000 steps (8 resets) in 109745 ms. (36 steps per ms) remains 220/225 properties
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40001 steps (8 resets) in 340 ms. (117 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40001 steps (8 resets) in 355 ms. (112 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40002 steps (8 resets) in 351 ms. (113 steps per ms) remains 218/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 317 ms. (125 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 303 ms. (131 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (8 resets) in 379 ms. (105 steps per ms) remains 213/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40001 steps (8 resets) in 440 ms. (90 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 432 ms. (92 steps per ms) remains 212/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 429 ms. (93 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40001 steps (8 resets) in 414 ms. (96 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40001 steps (8 resets) in 501 ms. (79 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40002 steps (8 resets) in 440 ms. (90 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40003 steps (8 resets) in 581 ms. (68 steps per ms) remains 202/212 properties
BEST_FIRST walk for 40003 steps (8 resets) in 497 ms. (80 steps per ms) remains 201/202 properties
BEST_FIRST walk for 40002 steps (8 resets) in 392 ms. (101 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 200/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 198/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (8 resets) in 483 ms. (82 steps per ms) remains 197/198 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 328 ms. (121 steps per ms) remains 192/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 372 ms. (107 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 513 ms. (77 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 415 ms. (96 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 424 ms. (94 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 520 ms. (76 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 335 ms. (119 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 314 ms. (126 steps per ms) remains 183/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 403 ms. (99 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40001 steps (8 resets) in 372 ms. (107 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40002 steps (8 resets) in 424 ms. (94 steps per ms) remains 180/183 properties
BEST_FIRST walk for 40002 steps (8 resets) in 291 ms. (136 steps per ms) remains 178/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40001 steps (8 resets) in 412 ms. (96 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (8 resets) in 468 ms. (85 steps per ms) remains 174/178 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 439 ms. (90 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (8 resets) in 453 ms. (88 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 171/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 169/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40001 steps (8 resets) in 443 ms. (90 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40003 steps (8 resets) in 561 ms. (71 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 169/169 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 167/169 properties
BEST_FIRST walk for 40002 steps (8 resets) in 406 ms. (98 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 386 ms. (103 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 412 ms. (96 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40001 steps (8 resets) in 373 ms. (106 steps per ms) remains 166/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 427 ms. (93 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 163/166 properties
BEST_FIRST walk for 40001 steps (8 resets) in 345 ms. (115 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 430 ms. (92 steps per ms) remains 161/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 160/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 376 ms. (106 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (8 resets) in 367 ms. (108 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40001 steps (8 resets) in 278 ms. (143 steps per ms) remains 159/160 properties
BEST_FIRST walk for 40001 steps (8 resets) in 359 ms. (111 steps per ms) remains 158/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 153/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 270 ms. (147 steps per ms) remains 152/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 398 ms. (100 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (8 resets) in 398 ms. (100 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 151/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 356 ms. (112 steps per ms) remains 150/151 properties
BEST_FIRST walk for 40003 steps (8 resets) in 315 ms. (126 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 149/150 properties
BEST_FIRST walk for 40002 steps (8 resets) in 518 ms. (77 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 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 40002 steps (8 resets) in 372 ms. (107 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40001 steps (8 resets) in 513 ms. (77 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 469 ms. (85 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40001 steps (8 resets) in 388 ms. (102 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 337 ms. (118 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 148/149 properties
BEST_FIRST walk for 40001 steps (8 resets) in 419 ms. (95 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40001 steps (8 resets) in 367 ms. (108 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (8 resets) in 306 ms. (130 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40000 steps (8 resets) in 399 ms. (100 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (8 resets) in 289 ms. (137 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40000 steps (8 resets) in 406 ms. (98 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (8 resets) in 407 ms. (98 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (8 resets) in 410 ms. (97 steps per ms) remains 147/148 properties
BEST_FIRST walk for 40002 steps (8 resets) in 353 ms. (113 steps per ms) remains 147/147 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 146/147 properties
BEST_FIRST walk for 40002 steps (8 resets) in 339 ms. (117 steps per ms) remains 143/146 properties
BEST_FIRST walk for 40002 steps (8 resets) in 264 ms. (150 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 139/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 139/139 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 139/139 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 139/139 properties
BEST_FIRST walk for 40002 steps (8 resets) in 316 ms. (126 steps per ms) remains 135/139 properties
BEST_FIRST walk for 40002 steps (8 resets) in 399 ms. (100 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 134/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40003 steps (8 resets) in 388 ms. (102 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 132/134 properties
BEST_FIRST walk for 40000 steps (8 resets) in 386 ms. (103 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40002 steps (8 resets) in 321 ms. (124 steps per ms) remains 130/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40002 steps (8 resets) in 359 ms. (111 steps per ms) remains 121/130 properties
// Phase 1: matrix 2090 rows 338 cols
[2025-05-29 18:19:51] [INFO ] Computed 22 invariants in 14 ms
[2025-05-29 18:19:51] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 251/313 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 24/337 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:19:54] [INFO ] Deduced a trap composed of 175 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:19:54] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 7 ms to minimize.
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 90 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 128 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 130 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 92 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 86 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 96 places in 326 ms of which 2 ms to minimize.
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 118 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 144 places in 307 ms of which 2 ms to minimize.
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 75 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 118 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 92 places in 257 ms of which 3 ms to minimize.
[2025-05-29 18:19:58] [INFO ] Deduced a trap composed of 122 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:19:58] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:19:58] [INFO ] Deduced a trap composed of 111 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:19:59] [INFO ] Deduced a trap composed of 130 places in 305 ms of which 2 ms to minimize.
[2025-05-29 18:19:59] [INFO ] Deduced a trap composed of 124 places in 274 ms of which 3 ms to minimize.
[2025-05-29 18:19:59] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 121 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:01] [INFO ] Deduced a trap composed of 148 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:20:01] [INFO ] Deduced a trap composed of 115 places in 319 ms of which 2 ms to minimize.
[2025-05-29 18:20:01] [INFO ] Deduced a trap composed of 103 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:02] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:02] [INFO ] Deduced a trap composed of 138 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:20:02] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:20:03] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:03] [INFO ] Deduced a trap composed of 105 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:20:03] [INFO ] Deduced a trap composed of 83 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:20:03] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:20:04] [INFO ] Deduced a trap composed of 141 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:20:04] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:04] [INFO ] Deduced a trap composed of 107 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:20:04] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:05] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:05] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 129 places in 266 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 135 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:20:07] [INFO ] Deduced a trap composed of 84 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:20:07] [INFO ] Deduced a trap composed of 126 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:20:08] [INFO ] Deduced a trap composed of 126 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:08] [INFO ] Deduced a trap composed of 116 places in 347 ms of which 2 ms to minimize.
[2025-05-29 18:20:08] [INFO ] Deduced a trap composed of 124 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:20:09] [INFO ] Deduced a trap composed of 128 places in 278 ms of which 2 ms to minimize.
[2025-05-29 18:20:09] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:20:09] [INFO ] Deduced a trap composed of 99 places in 297 ms of which 2 ms to minimize.
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 128 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 93 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 136 places in 307 ms of which 2 ms to minimize.
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:20:11] [INFO ] Deduced a trap composed of 135 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:20:11] [INFO ] Deduced a trap composed of 95 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:20:11] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:20:12] [INFO ] Deduced a trap composed of 119 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:20:12] [INFO ] Deduced a trap composed of 122 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:20:12] [INFO ] Deduced a trap composed of 138 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:12] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:14] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:14] [INFO ] Deduced a trap composed of 78 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 110 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 122 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 195 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 96 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 155 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 103 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 84 places in 305 ms of which 2 ms to minimize.
[2025-05-29 18:20:17] [INFO ] Deduced a trap composed of 141 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:20:17] [INFO ] Deduced a trap composed of 112 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:20:17] [INFO ] Deduced a trap composed of 153 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:20:18] [INFO ] Deduced a trap composed of 80 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:18] [INFO ] Deduced a trap composed of 77 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:20:18] [INFO ] Deduced a trap composed of 90 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:20:18] [INFO ] Deduced a trap composed of 83 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 182 places in 300 ms of which 2 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 134 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:20:20] [INFO ] Deduced a trap composed of 107 places in 271 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:22] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:22] [INFO ] Deduced a trap composed of 127 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:20:22] [INFO ] Deduced a trap composed of 84 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:20:23] [INFO ] Deduced a trap composed of 98 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:20:23] [INFO ] Deduced a trap composed of 102 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:20:23] [INFO ] Deduced a trap composed of 119 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:20:24] [INFO ] Deduced a trap composed of 141 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:20:24] [INFO ] Deduced a trap composed of 80 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:20:24] [INFO ] Deduced a trap composed of 109 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:20:24] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:26] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:20:26] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:26] [INFO ] Deduced a trap composed of 91 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:20:26] [INFO ] Deduced a trap composed of 129 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:20:27] [INFO ] Deduced a trap composed of 144 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:20:27] [INFO ] Deduced a trap composed of 119 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:20:27] [INFO ] Deduced a trap composed of 119 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:20:28] [INFO ] Deduced a trap composed of 145 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:28] [INFO ] Deduced a trap composed of 104 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:28] [INFO ] Deduced a trap composed of 141 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:20:28] [INFO ] Deduced a trap composed of 188 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:20:29] [INFO ] Deduced a trap composed of 125 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:20:29] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:20:29] [INFO ] Deduced a trap composed of 75 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:20:31] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:31] [INFO ] Deduced a trap composed of 127 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:20:32] [INFO ] Deduced a trap composed of 137 places in 297 ms of which 2 ms to minimize.
[2025-05-29 18:20:32] [INFO ] Deduced a trap composed of 191 places in 247 ms of which 5 ms to minimize.
[2025-05-29 18:20:32] [INFO ] Deduced a trap composed of 188 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:20:32] [INFO ] Deduced a trap composed of 136 places in 267 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:35] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:20:35] [INFO ] Deduced a trap composed of 68 places in 288 ms of which 2 ms to minimize.
[2025-05-29 18:20:36] [INFO ] Deduced a trap composed of 94 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:20:36] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:20:36] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 3 ms to minimize.
[2025-05-29 18:20:37] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:20:37] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:20:37] [INFO ] Deduced a trap composed of 150 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:20:37] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:20:38] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:20:38] [INFO ] Deduced a trap composed of 104 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:20:38] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:20:39] [INFO ] Deduced a trap composed of 90 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:20:39] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 14/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:41] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 3 ms to minimize.
[2025-05-29 18:20:41] [INFO ] Deduced a trap composed of 93 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 91 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 101 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 80 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 127 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 2 ms to minimize.
[2025-05-29 18:20:44] [INFO ] Deduced a trap composed of 78 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:20:44] [INFO ] Deduced a trap composed of 79 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:20:44] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 106 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 98 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 86 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:20:46] [INFO ] Deduced a trap composed of 97 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:20:46] [INFO ] Deduced a trap composed of 113 places in 300 ms of which 2 ms to minimize.
[2025-05-29 18:20:46] [INFO ] Deduced a trap composed of 85 places in 294 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 19/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 1/338 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:50] [INFO ] Deduced a trap composed of 118 places in 300 ms of which 2 ms to minimize.
[2025-05-29 18:20:50] [INFO ] Deduced a trap composed of 127 places in 321 ms of which 2 ms to minimize.
[2025-05-29 18:20:51] [INFO ] Deduced a trap composed of 117 places in 292 ms of which 2 ms to minimize.
[2025-05-29 18:20:51] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:20:51] [INFO ] Deduced a trap composed of 95 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:20:52] [INFO ] Deduced a trap composed of 101 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:20:52] [INFO ] Deduced a trap composed of 99 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:20:52] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 2 ms to minimize.
[2025-05-29 18:20:53] [INFO ] Deduced a trap composed of 121 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:20:53] [INFO ] Deduced a trap composed of 111 places in 305 ms of which 2 ms to minimize.
[2025-05-29 18:20:53] [INFO ] Deduced a trap composed of 116 places in 295 ms of which 2 ms to minimize.
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 60 places in 297 ms of which 2 ms to minimize.
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 101 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 87 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:20:55] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:20:55] [INFO ] Deduced a trap composed of 79 places in 301 ms of which 2 ms to minimize.
[2025-05-29 18:20:55] [INFO ] Deduced a trap composed of 128 places in 289 ms of which 2 ms to minimize.
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 99 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 74 places in 315 ms of which 2 ms to minimize.
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 78 places in 301 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 78 places in 304 ms of which 2 ms to minimize.
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 109 places in 304 ms of which 3 ms to minimize.
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 116 places in 301 ms of which 2 ms to minimize.
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 94 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 80 places in 310 ms of which 2 ms to minimize.
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 85 places in 298 ms of which 2 ms to minimize.
[2025-05-29 18:21:00] [INFO ] Deduced a trap composed of 57 places in 319 ms of which 2 ms to minimize.
[2025-05-29 18:21:00] [INFO ] Deduced a trap composed of 80 places in 287 ms of which 2 ms to minimize.
[2025-05-29 18:21:00] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:21:01] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:21:01] [INFO ] Deduced a trap composed of 85 places in 308 ms of which 5 ms to minimize.
[2025-05-29 18:21:01] [INFO ] Deduced a trap composed of 76 places in 348 ms of which 2 ms to minimize.
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 3 ms to minimize.
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 100 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 2 ms to minimize.
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 89 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 75 places in 302 ms of which 2 ms to minimize.
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 98 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:04] [INFO ] Deduced a trap composed of 94 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:04] [INFO ] Deduced a trap composed of 95 places in 299 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/2428 variables, and 205 constraints, problems are : Problem set: 0 solved, 121 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/338 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 183/183 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 251/313 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 24/337 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:21:10] [INFO ] Deduced a trap composed of 124 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:21:10] [INFO ] Deduced a trap composed of 155 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:21:10] [INFO ] Deduced a trap composed of 123 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:21:10] [INFO ] Deduced a trap composed of 148 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:21:11] [INFO ] Deduced a trap composed of 88 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:21:11] [INFO ] Deduced a trap composed of 97 places in 289 ms of which 2 ms to minimize.
[2025-05-29 18:21:11] [INFO ] Deduced a trap composed of 94 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:21:12] [INFO ] Deduced a trap composed of 103 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:21:12] [INFO ] Deduced a trap composed of 116 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:21:12] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 3 ms to minimize.
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 100 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 75 places in 278 ms of which 2 ms to minimize.
[2025-05-29 18:21:14] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:21:14] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:21:14] [INFO ] Deduced a trap composed of 106 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:21:15] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 3 ms to minimize.
[2025-05-29 18:21:15] [INFO ] Deduced a trap composed of 80 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:21:16] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:21:18] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:21:18] [INFO ] Deduced a trap composed of 88 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:21:18] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:21:19] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:19] [INFO ] Deduced a trap composed of 151 places in 269 ms of which 2 ms to minimize.
[2025-05-29 18:21:20] [INFO ] Deduced a trap composed of 113 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:21:20] [INFO ] Deduced a trap composed of 94 places in 252 ms of which 4 ms to minimize.
[2025-05-29 18:21:20] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:21:21] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:21] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:21:21] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:21:22] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:21:22] [INFO ] Deduced a trap composed of 94 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:21:23] [INFO ] Deduced a trap composed of 83 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:21:23] [INFO ] Deduced a trap composed of 128 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:21:23] [INFO ] Deduced a trap composed of 126 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:21:23] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:21:24] [INFO ] Deduced a trap composed of 123 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:21:24] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:21:24] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:21:26] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:26] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 57 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 92 places in 281 ms of which 2 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:21:29] [INFO ] Deduced a trap composed of 101 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:21:29] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:21:29] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:30] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:21:30] [INFO ] Deduced a trap composed of 78 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:21:30] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:21:31] [INFO ] Deduced a trap composed of 87 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:21:34] [INFO ] Deduced a trap composed of 112 places in 252 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 94 places in 280 ms of which 3 ms to minimize.
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 2 ms to minimize.
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 168 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 159 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 176 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 154 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 95 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 3 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 106 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 103 places in 296 ms of which 2 ms to minimize.
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 92 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 191 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 133 places in 270 ms of which 2 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 138 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 154 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 192 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 79 places in 280 ms of which 2 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 104 places in 287 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-29 18:21:47] [INFO ] Deduced a trap composed of 112 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:21:47] [INFO ] Deduced a trap composed of 127 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 138 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 120 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 57 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 117 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 141 places in 275 ms of which 2 ms to minimize.
[2025-05-29 18:21:50] [INFO ] Deduced a trap composed of 133 places in 273 ms of which 2 ms to minimize.
[2025-05-29 18:21:50] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:21:50] [INFO ] Deduced a trap composed of 115 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:21:51] [INFO ] Deduced a trap composed of 188 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:21:51] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:21:51] [INFO ] Deduced a trap composed of 111 places in 335 ms of which 2 ms to minimize.
[2025-05-29 18:21:52] [INFO ] Deduced a trap composed of 82 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:21:53] [INFO ] Deduced a trap composed of 79 places in 272 ms of which 2 ms to minimize.
[2025-05-29 18:21:53] [INFO ] Deduced a trap composed of 113 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:21:53] [INFO ] Deduced a trap composed of 86 places in 264 ms of which 2 ms to minimize.
[2025-05-29 18:21:54] [INFO ] Deduced a trap composed of 92 places in 277 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 1/338 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
SMT process timed out in 150379ms, After SMT, problems are : Problem set: 0 solved, 121 unsolved
Fused 121 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 2090/2090 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 307 transition count 1573
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 307 transition count 1573
Applied a total of 62 rules in 60 ms. Remains 307 /338 variables (removed 31) and now considering 1573/2090 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 307/338 places, 1573/2090 transitions.
RANDOM walk for 4000000 steps (8 resets) in 41142 ms. (97 steps per ms) remains 119/121 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 116/119 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 239 ms. (166 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 376 ms. (106 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 292 ms. (136 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40001 steps (8 resets) in 190 ms. (209 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 268 ms. (148 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 324 ms. (123 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 114/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 239 ms. (166 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 263 ms. (151 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 172 ms. (231 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 249 ms. (160 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 272 ms. (146 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 317 ms. (125 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 276 ms. (144 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 293 ms. (136 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 223 ms. (178 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 446 ms. (89 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 241 ms. (165 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 112/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 108/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 229 ms. (173 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 268 ms. (148 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 240 ms. (165 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 279 ms. (142 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 294 ms. (135 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 210 ms. (189 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 241 ms. (165 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 246 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 108/108 properties
// Phase 1: matrix 1573 rows 307 cols
[2025-05-29 18:22:44] [INFO ] Computed 22 invariants in 7 ms
[2025-05-29 18:22:44] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 221/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 25/306 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 2 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 2 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 124 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 112 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:22:47] [INFO ] Deduced a trap composed of 123 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:22:47] [INFO ] Deduced a trap composed of 109 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:22:47] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:22:47] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:22:47] [INFO ] Deduced a trap composed of 87 places in 201 ms of which 1 ms to minimize.
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 1 ms to minimize.
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 89 places in 194 ms of which 1 ms to minimize.
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 132 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 91 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 106 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 86 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:22:52] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:22:53] [INFO ] Deduced a trap composed of 106 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:22:53] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:22:54] [INFO ] Deduced a trap composed of 90 places in 222 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:22:55] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 104 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 3 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 110 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 1/307 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:23:02] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:23:02] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:23:02] [INFO ] Deduced a trap composed of 87 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:23:03] [INFO ] Deduced a trap composed of 99 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:23:03] [INFO ] Deduced a trap composed of 95 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 75 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 108 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 79 places in 229 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:23:05] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 6 ms to minimize.
[2025-05-29 18:23:06] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 1573/1880 variables, 307/382 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1880 variables, 90/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1880 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 0/1880 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1880/1880 variables, and 472 constraints, problems are : Problem set: 0 solved, 108 unsolved in 42733 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 307/307 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 221/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 25/306 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/307 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:23:30] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:23:30] [INFO ] Deduced a trap composed of 83 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:23:30] [INFO ] Deduced a trap composed of 106 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 87 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 115 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 99 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:23:33] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-29 18:23:35] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:23:35] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 104 places in 227 ms of which 2 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 98 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 1 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 1 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 91 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 91 places in 228 ms of which 2 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:23:39] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 1573/1880 variables, 307/412 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1880 variables, 90/502 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1880 variables, 108/610 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1880 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1880/1880 variables, and 610 constraints, problems are : Problem set: 0 solved, 108 unsolved in 90021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 307/307 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 83/83 constraints]
After SMT, in 132980ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 1573/1573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 306 transition count 1554
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 306 transition count 1554
Applied a total of 2 rules in 31 ms. Remains 306 /307 variables (removed 1) and now considering 1554/1573 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 306/307 places, 1554/1573 transitions.
RANDOM walk for 4000000 steps (8 resets) in 45189 ms. (88 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 107/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (8 resets) in 135 ms. (294 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 134 ms. (296 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 106/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (8 resets) in 131 ms. (303 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (8 resets) in 100 ms. (396 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 102/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 134 ms. (296 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 100/101 properties
BEST_FIRST walk for 40001 steps (8 resets) in 136 ms. (291 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 98/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 95/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 140 ms. (283 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40001 steps (8 resets) in 95 ms. (416 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 93/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 93/93 properties
// Phase 1: matrix 1554 rows 306 cols
[2025-05-29 18:25:13] [INFO ] Computed 22 invariants in 6 ms
[2025-05-29 18:25:13] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 224/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 26/305 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 101 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:25:16] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 4 ms to minimize.
[2025-05-29 18:25:16] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:16] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:17] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:25:17] [INFO ] Deduced a trap composed of 106 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 96 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:25:20] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:25:20] [INFO ] Deduced a trap composed of 103 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:25:20] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:25:20] [INFO ] Deduced a trap composed of 116 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:25:20] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:25:21] [INFO ] Deduced a trap composed of 115 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:25:21] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:25:21] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 3 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 97 places in 230 ms of which 1 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 98 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 1 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 99 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 99 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 92 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 101 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 94 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 100 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 98 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 102 places in 218 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 1/306 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:25:48] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 98 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 90 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 1554/1860 variables, 306/398 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1860 variables, 90/488 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1860 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 19 (OVERLAPS) 0/1860 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1860/1860 variables, and 488 constraints, problems are : Problem set: 0 solved, 93 unsolved in 68336 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 306/306 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 224/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 26/305 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 1554/1860 variables, 306/401 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1860 variables, 90/491 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1860 variables, 93/584 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1860 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/1860 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1860/1860 variables, and 584 constraints, problems are : Problem set: 0 solved, 93 unsolved in 83506 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 306/306 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 73/73 constraints]
After SMT, in 152103ms problems are : Problem set: 0 solved, 93 unsolved
Parikh walk visited 0 properties in 580 ms.
Support contains 55 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1554/1554 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 302 transition count 1478
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 302 transition count 1478
Applied a total of 8 rules in 25 ms. Remains 302 /306 variables (removed 4) and now considering 1478/1554 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 302/306 places, 1478/1554 transitions.
RANDOM walk for 4000000 steps (8 resets) in 34522 ms. (115 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1712 ms. (233 steps per ms) remains 90/93 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2142 ms. (186 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2563 ms. (156 steps per ms) remains 89/90 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2870 ms. (139 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2488 ms. (160 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2629 ms. (152 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2066 ms. (193 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2526 ms. (158 steps per ms) remains 88/89 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3090 ms. (129 steps per ms) remains 86/88 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2135 ms. (187 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2395 ms. (166 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2266 ms. (176 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2373 ms. (168 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2772 ms. (144 steps per ms) remains 84/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2368 ms. (168 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2720 ms. (147 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3200 ms. (124 steps per ms) remains 82/84 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2818 ms. (141 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3007 ms. (132 steps per ms) remains 79/82 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3051 ms. (131 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2488 ms. (160 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2455 ms. (162 steps per ms) remains 77/79 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1924 ms. (207 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2396 ms. (166 steps per ms) remains 74/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2446 ms. (163 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2528 ms. (158 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3092 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2284 ms. (175 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2036 ms. (196 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2459 ms. (162 steps per ms) remains 72/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2727 ms. (146 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2788 ms. (143 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2280 ms. (175 steps per ms) remains 71/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2229 ms. (179 steps per ms) remains 68/71 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2276 ms. (175 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2430 ms. (164 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2234 ms. (178 steps per ms) remains 65/68 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2495 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2344 ms. (170 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2874 ms. (139 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2323 ms. (172 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2661 ms. (150 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2529 ms. (158 steps per ms) remains 63/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2503 ms. (159 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2152 ms. (185 steps per ms) remains 60/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2254 ms. (177 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2569 ms. (155 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2194 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2583 ms. (154 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2386 ms. (167 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1985 ms. (201 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2052 ms. (194 steps per ms) remains 56/58 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2142 ms. (186 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1931 ms. (207 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2110 ms. (189 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2642 ms. (151 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2652 ms. (150 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2294 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2403 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1854 ms. (215 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1991 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2262 ms. (176 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2501 ms. (159 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2539 ms. (157 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2475 ms. (161 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2480 ms. (161 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2540 ms. (157 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2347 ms. (170 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2542 ms. (157 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2472 ms. (161 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2556 ms. (156 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2255 ms. (177 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2059 ms. (194 steps per ms) remains 53/53 properties
// Phase 1: matrix 1478 rows 302 cols
[2025-05-29 18:28:52] [INFO ] Computed 22 invariants in 6 ms
[2025-05-29 18:28:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 231/274 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 27/301 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:28:53] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:28:53] [INFO ] Deduced a trap composed of 114 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 111 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 115 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 129 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:55] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 104 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:56] [INFO ] Deduced a trap composed of 108 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 96 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 117 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 118 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 102 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 106 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 128 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 127 places in 210 ms of which 1 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 90 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 106 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 130 places in 211 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:29:03] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:29:04] [INFO ] Deduced a trap composed of 94 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:29:04] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:29:05] [INFO ] Deduced a trap composed of 94 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:05] [INFO ] Deduced a trap composed of 104 places in 214 ms of which 1 ms to minimize.
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 104 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 73 places in 218 ms of which 3 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 102 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:29:08] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 3 ms to minimize.
[2025-05-29 18:29:08] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:29:08] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:29:08] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:29:09] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 1 ms to minimize.
[2025-05-29 18:29:09] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:29:09] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:29:10] [INFO ] Deduced a trap composed of 99 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:29:10] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:29:10] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:29:10] [INFO ] Deduced a trap composed of 91 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:29:11] [INFO ] Deduced a trap composed of 98 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:29:11] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:29:11] [INFO ] Deduced a trap composed of 99 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:29:11] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:29:11] [INFO ] Deduced a trap composed of 99 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:29:12] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:29:12] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:29:12] [INFO ] Deduced a trap composed of 97 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:29:13] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:29:13] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 1478/1780 variables, 302/399 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1780 variables, 90/489 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1780 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/1780 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 489 constraints, problems are : Problem set: 0 solved, 53 unsolved in 31364 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 231/274 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 27/301 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/302 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:29:26] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:29:26] [INFO ] Deduced a trap composed of 72 places in 213 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1478/1780 variables, 302/401 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1780 variables, 90/491 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1780 variables, 53/544 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1780 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 0/1780 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1780/1780 variables, and 544 constraints, problems are : Problem set: 0 solved, 53 unsolved in 28437 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 77/77 constraints]
After SMT, in 59950ms problems are : Problem set: 0 solved, 53 unsolved
Parikh walk visited 19 properties in 15337 ms.
Support contains 30 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 1478/1478 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 278 transition count 1022
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 278 transition count 1022
Applied a total of 48 rules in 31 ms. Remains 278 /302 variables (removed 24) and now considering 1022/1478 (removed 456) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 278/302 places, 1022/1478 transitions.
RANDOM walk for 4000000 steps (8 resets) in 60605 ms. (66 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1624 ms. (246 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1804 ms. (221 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1864 ms. (214 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2033 ms. (196 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2363 ms. (169 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2447 ms. (163 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1714 ms. (233 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1948 ms. (205 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2058 ms. (194 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2305 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1810 ms. (220 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1664 ms. (240 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1736 ms. (230 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1830 ms. (218 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1532 ms. (260 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1590 ms. (251 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2091 ms. (191 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1713 ms. (233 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1496 ms. (267 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1593 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1824 ms. (219 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2248 ms. (177 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1938 ms. (206 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2135 ms. (187 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2166 ms. (184 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2002 ms. (199 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2048 ms. (195 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1474 ms. (271 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1934 ms. (206 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2231 ms. (179 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2396 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2662 ms. (150 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1938 ms. (206 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1773 ms. (225 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 7043251 steps, run timeout after 123001 ms. (steps per millisecond=57 ) properties seen :0 out of 32
Probabilistic random walk after 7043251 steps, saw 4194908 distinct states, run finished after 123006 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 1022 rows 278 cols
[2025-05-29 18:32:52] [INFO ] Computed 22 invariants in 5 ms
[2025-05-29 18:32:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 221/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 72 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 1 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 1 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 1 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 1 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 1 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 1 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 1022/1300 variables, 278/378 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1300 variables, 90/468 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1300 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/1300 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 468 constraints, problems are : Problem set: 0 solved, 32 unsolved in 20182 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 221/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 1 ms to minimize.
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 1 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 1022/1300 variables, 278/385 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1300 variables, 90/475 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1300 variables, 32/507 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1300 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/1300 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 507 constraints, problems are : Problem set: 0 solved, 32 unsolved in 15061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 85/85 constraints]
After SMT, in 35301ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 2 properties in 3379 ms.
Support contains 27 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 1022/1022 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 965
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 965
Applied a total of 6 rules in 15 ms. Remains 275 /278 variables (removed 3) and now considering 965/1022 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 275/278 places, 965/1022 transitions.
RANDOM walk for 4000000 steps (8 resets) in 55641 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1646 ms. (242 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1691 ms. (236 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2111 ms. (189 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1993 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1881 ms. (212 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2059 ms. (194 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2015 ms. (198 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2014 ms. (198 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2108 ms. (189 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2027 ms. (197 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2189 ms. (182 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1747 ms. (228 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2357 ms. (169 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1812 ms. (220 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1764 ms. (226 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1560 ms. (256 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1475 ms. (271 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1871 ms. (213 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2214 ms. (180 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2509 ms. (159 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2025 ms. (197 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2086 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1782 ms. (224 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1568 ms. (254 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1966 ms. (203 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1601 ms. (249 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2154 ms. (185 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2154 ms. (185 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1712 ms. (233 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1755 ms. (227 steps per ms) remains 27/27 properties
// Phase 1: matrix 965 rows 275 cols
[2025-05-29 18:34:06] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:34:06] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 221/247 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 27/274 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:34:07] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/275 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 1 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 1 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 1 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:34:19] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:34:19] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:34:19] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 965/1240 variables, 275/358 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1240 variables, 90/448 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1240 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/1240 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 448 constraints, problems are : Problem set: 0 solved, 27 unsolved in 16839 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 275/275 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 221/247 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 27/274 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/275 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:34:25] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:34:26] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 965/1240 variables, 275/369 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1240 variables, 90/459 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1240 variables, 27/486 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/1240 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 486 constraints, problems are : Problem set: 0 solved, 27 unsolved in 10985 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 275/275 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 72/72 constraints]
After SMT, in 27877ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 1828 ms.
Support contains 26 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 965/965 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 274 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 946
Applied a total of 2 rules in 14 ms. Remains 274 /275 variables (removed 1) and now considering 946/965 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 274/275 places, 946/965 transitions.
RANDOM walk for 4000000 steps (8 resets) in 69608 ms. (57 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2058 ms. (194 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1931 ms. (207 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1454 ms. (274 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1895 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2011 ms. (198 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1819 ms. (219 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1730 ms. (231 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2071 ms. (193 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2070 ms. (193 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1681 ms. (237 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1548 ms. (258 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1680 ms. (237 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2041 ms. (195 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2086 ms. (191 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2107 ms. (189 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1376 ms. (290 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1838 ms. (217 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1618 ms. (247 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1684 ms. (237 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1920 ms. (208 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1696 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1986 ms. (201 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1973 ms. (202 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1704 ms. (234 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1716 ms. (232 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1996 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1843 ms. (216 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 7237694 steps, run timeout after 108001 ms. (steps per millisecond=67 ) properties seen :0 out of 25
Probabilistic random walk after 7237694 steps, saw 4130860 distinct states, run finished after 108002 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 946 rows 274 cols
[2025-05-29 18:37:00] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:37:00] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 221/246 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 27/273 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-29 18:37:01] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:37:01] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:37:01] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:37:01] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 1 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 1 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 1 ms to minimize.
[2025-05-29 18:37:02] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:37:03] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-29 18:37:03] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:37:03] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 1 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2025-05-29 18:37:04] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 1 ms to minimize.
[2025-05-29 18:37:05] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:37:06] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-29 18:37:06] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:37:06] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-29 18:37:06] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 129 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 1 ms to minimize.
[2025-05-29 18:37:07] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:37:08] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-29 18:37:08] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:37:08] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2025-05-29 18:37:08] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:37:08] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 946/1220 variables, 274/336 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1220 variables, 90/426 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1220 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1220 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 426 constraints, problems are : Problem set: 0 solved, 25 unsolved in 11557 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 274/274 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 221/246 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 27/273 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 946/1220 variables, 274/336 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1220 variables, 90/426 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 25/451 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/1220 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 451 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4833 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 274/274 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 40/40 constraints]
After SMT, in 16445ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 5 properties in 7402 ms.
Support contains 21 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 946/946 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 269 transition count 851
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 269 transition count 851
Applied a total of 10 rules in 14 ms. Remains 269 /274 variables (removed 5) and now considering 851/946 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 269/274 places, 851/946 transitions.
RANDOM walk for 4000000 steps (8 resets) in 68776 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1701 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1813 ms. (220 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1702 ms. (234 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1766 ms. (226 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1701 ms. (235 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1971 ms. (202 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1559 ms. (256 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1851 ms. (215 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1821 ms. (219 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1962 ms. (203 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1955 ms. (204 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1657 ms. (241 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1898 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1613 ms. (247 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2213 ms. (180 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1922 ms. (208 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1687 ms. (236 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1952 ms. (204 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1763 ms. (226 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1393 ms. (286 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 5805216 steps, run timeout after 90001 ms. (steps per millisecond=64 ) properties seen :8 out of 19
Probabilistic random walk after 5805216 steps, saw 3398984 distinct states, run finished after 90001 ms. (steps per millisecond=64 ) properties seen :8
// Phase 1: matrix 851 rows 269 cols
[2025-05-29 18:39:25] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:39:25] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 140/263 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6/269 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 851/1120 variables, 269/291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1120 variables, 90/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1120 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 381 constraints, problems are : Problem set: 0 solved, 11 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 140/263 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6/269 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 851/1120 variables, 269/291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1120 variables, 90/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 11/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1120 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 392 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2238ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 4688 ms.
Support contains 12 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 851/851 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 261 transition count 699
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 261 transition count 699
Applied a total of 16 rules in 16 ms. Remains 261 /269 variables (removed 8) and now considering 699/851 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 261/269 places, 699/851 transitions.
RANDOM walk for 4000000 steps (8 resets) in 40386 ms. (99 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 15459 ms. (258 steps per ms) remains 10/11 properties
BEST_FIRST walk for 3997576 steps (8 resets) in 15431 ms. (259 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 15734 ms. (254 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 11062 ms. (361 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11012 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 13141 ms. (304 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 11399 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10851 ms. (368 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 12903 ms. (309 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 12713 ms. (314 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 12650 ms. (316 steps per ms) remains 5/5 properties
// Phase 1: matrix 699 rows 261 cols
[2025-05-29 18:40:30] [INFO ] Computed 22 invariants in 5 ms
[2025-05-29 18:40:30] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 229/235 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/241 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/260 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/261 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-05-29 18:40:30] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:40:30] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 1 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 1 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:40:33] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 699/960 variables, 261/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 90/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/960 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 960/960 variables, and 390 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 261/261 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 229/235 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/241 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/260 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/261 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 699/960 variables, 261/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 90/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/960 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 960/960 variables, and 395 constraints, problems are : Problem set: 0 solved, 5 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 261/261 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints]
After SMT, in 3818ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 6 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 699/699 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 585
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 585
Applied a total of 12 rules in 11 ms. Remains 255 /261 variables (removed 6) and now considering 585/699 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 255/261 places, 585/699 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30517 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 12670 ms. (315 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11261 ms. (355 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10152 ms. (393 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7635 ms. (523 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2542 ms. (1572 steps per ms) remains 1/1 properties
// Phase 1: matrix 585 rows 255 cols
[2025-05-29 18:40:58] [INFO ] Computed 22 invariants in 11 ms
[2025-05-29 18:40:58] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:40:58] [INFO ] Deduced a trap composed of 195 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/245 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/255 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 585/840 variables, 255/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/245 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/255 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 585/840 variables, 255/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 585/585 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 251 transition count 509
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 251 transition count 509
Applied a total of 8 rules in 9 ms. Remains 251 /255 variables (removed 4) and now considering 509/585 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 251/255 places, 509/585 transitions.
RANDOM walk for 4000000 steps (8 resets) in 5977 ms. (669 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2442 ms. (1637 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2338905 steps, run timeout after 6001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 2338905 steps, saw 1637809 distinct states, run finished after 6001 ms. (steps per millisecond=389 ) properties seen :0
// Phase 1: matrix 509 rows 251 cols
[2025-05-29 18:41:06] [INFO ] Computed 22 invariants in 9 ms
[2025-05-29 18:41:06] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 509/760 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/760 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:07] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2025-05-29 18:41:08] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:41:08] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:41:08] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/251 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 509/760 variables, 251/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 90/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/760 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 251/251 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2025-05-29 18:41:08] [INFO ] Invariant cache hit.
[2025-05-29 18:41:08] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-29 18:41:08] [INFO ] Invariant cache hit.
[2025-05-29 18:41:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 18:41:09] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2025-05-29 18:41:09] [INFO ] Redundant transitions in 33 ms returned []
Running 499 sub problems to find dead transitions.
[2025-05-29 18:41:09] [INFO ] Invariant cache hit.
[2025-05-29 18:41:09] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 1 ms to minimize.
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:41:13] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2025-05-29 18:41:14] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 4 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 5 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 11 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 4 ms to minimize.
[2025-05-29 18:41:15] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 5 ms to minimize.
[2025-05-29 18:41:16] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 4 ms to minimize.
[2025-05-29 18:41:16] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 1 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:26] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:33] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:41:33] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:41:33] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:34] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 1 ms to minimize.
[2025-05-29 18:41:34] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 1 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/760 variables, and 114 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 1 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/760 variables, and 134 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/499 constraints, Known Traps: 112/112 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61271 ms. Remains : 251/251 places, 509/509 transitions.
RANDOM walk for 327315 steps (6 resets) in 1501 ms. (217 steps per ms) remains 0/2 properties
RANDOM walk for 4000000 steps (8 resets) in 6425 ms. (622 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2570 ms. (1555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2249039 steps, run timeout after 6001 ms. (steps per millisecond=374 ) properties seen :0 out of 1
Probabilistic random walk after 2249039 steps, saw 1576940 distinct states, run finished after 6001 ms. (steps per millisecond=374 ) properties seen :0
[2025-05-29 18:42:18] [INFO ] Invariant cache hit.
[2025-05-29 18:42:18] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 509/760 variables, 251/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/760 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/251 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 509/760 variables, 251/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/760 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 251/251 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2025-05-29 18:42:19] [INFO ] Invariant cache hit.
[2025-05-29 18:42:19] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-29 18:42:19] [INFO ] Invariant cache hit.
[2025-05-29 18:42:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 18:42:20] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2025-05-29 18:42:20] [INFO ] Redundant transitions in 17 ms returned []
Running 499 sub problems to find dead transitions.
[2025-05-29 18:42:20] [INFO ] Invariant cache hit.
[2025-05-29 18:42:20] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 1 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 1 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2025-05-29 18:42:24] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:25] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:42:26] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:42:26] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:42:26] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:26] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:42:26] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:28] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:42:28] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:42:29] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:30] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:31] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:42:31] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 1 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2025-05-29 18:42:39] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:42:42] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:42] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:44] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:42:45] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:42:46] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/760 variables, and 114 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:42:54] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 1 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:42:55] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 1 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 1 ms to minimize.
[2025-05-29 18:42:56] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:42:57] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/760 variables, and 134 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/499 constraints, Known Traps: 112/112 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61216 ms. Remains : 251/251 places, 509/509 transitions.
RANDOM walk for 400000 steps (8 resets) in 808 ms. (494 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2025-05-29 18:43:20] [INFO ] Invariant cache hit.
[2025-05-29 18:43:20] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 18:43:20] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2025-05-29 18:43:21] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-29 18:43:21] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 18:43:21] [INFO ] After 23ms SMT Verify possible using 90 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 18:43:21] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 18:43:21] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 18:43:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 18:43:21] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2025-05-29 18:43:21] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-29 18:43:21] [INFO ] After 49ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 18:43:21] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 18:43:21] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10983 steps, run visited all 1 properties in 30 ms. (steps per millisecond=366 )
Probabilistic random walk after 10983 steps, saw 9148 distinct states, run finished after 33 ms. (steps per millisecond=332 ) properties seen :1
RANDOM walk for 4281 steps (0 resets) in 12 ms. (329 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 251 transition count 409
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 151 transition count 409
Applied a total of 200 rules in 25 ms. Remains 151 /251 variables (removed 100) and now considering 409/509 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 409 rows 151 cols
[2025-05-29 18:43:21] [INFO ] Computed 22 invariants in 2 ms
[2025-05-29 18:43:21] [INFO ] [Real]Absence check using 12 positive place invariants in 93 ms returned sat
[2025-05-29 18:43:21] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 84 ms returned sat
[2025-05-29 18:43:22] [INFO ] After 1253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 18:43:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 18:43:22] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 9 ms returned sat
[2025-05-29 18:43:23] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 18:43:23] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 18:43:23] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1514 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1612805 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-10
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 621
TRANSITIONS: 2480
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 9560
NUPN UNITS: 13
LOADING TIME: 1.587
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.147
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.41
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4081
MODEL NAME: /home/mcc/execution/model
621 places, 2480 transitions.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-10"
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-10, 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-174853743400122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 ;