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.r084-tall-174860080700497.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 EisenbergMcGuire-PT-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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.7M 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 1748743015676

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:56:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:56:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:56:57] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-06-01 01:56:57] [INFO ] Transformed 712 places.
[2025-06-01 01:56:57] [INFO ] Transformed 2816 transitions.
[2025-06-01 01:56:57] [INFO ] Found NUPN structural information;
[2025-06-01 01:56:57] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 354 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 704 transition count 2608
Deduced a syphon composed of 200 places in 23 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 504 transition count 2608
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 448 transition count 2552
Applied a total of 528 rules in 195 ms. Remains 448 /712 variables (removed 264) and now considering 2552/2816 (removed 264) transitions.
[2025-06-01 01:56:57] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
// Phase 1: matrix 1104 rows 448 cols
[2025-06-01 01:56:57] [INFO ] Computed 25 invariants in 32 ms
[2025-06-01 01:56:58] [INFO ] Implicit Places using invariants in 842 ms returned []
[2025-06-01 01:56:58] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2025-06-01 01:56:58] [INFO ] Invariant cache hit.
[2025-06-01 01:56:59] [INFO ] State equation strengthened by 676 read => feed constraints.
[2025-06-01 01:57:01] [INFO ] Implicit Places using invariants and state equation in 2943 ms returned []
Implicit Place search using SMT with State Equation took 3818 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2025-06-01 01:57:01] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2025-06-01 01:57:01] [INFO ] Invariant cache hit.
[2025-06-01 01:57:01] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 448/448 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 17/465 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
[2025-06-01 01:57:23] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 48 ms to minimize.
[2025-06-01 01:57:23] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2025-06-01 01:57:23] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 2 ms to minimize.
[2025-06-01 01:57:24] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:57:24] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:57:24] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:57:24] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2025-06-01 01:57:24] [INFO ] Deduced a trap composed of 50 places in 298 ms of which 2 ms to minimize.
[2025-06-01 01:57:25] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:57:25] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 2 ms to minimize.
[2025-06-01 01:57:25] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
[2025-06-01 01:57:25] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 3 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 3 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2025-06-01 01:57:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:57:27] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 98 places in 308 ms of which 3 ms to minimize.
SMT process timed out in 31870ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 31916ms
Starting structural reductions in LIVENESS mode, iteration 1 : 448/712 places, 2552/2816 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 35977 ms. Remains : 448/712 places, 2552/2816 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 6690 ms. (5 steps per ms) remains 2103/2544 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 50 ms. (2 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 37 ms. (3 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2103/2103 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2103/2103 properties
[2025-06-01 01:57:35] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2025-06-01 01:57:35] [INFO ] Invariant cache hit.
[2025-06-01 01:57:35] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 346/346 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
SMT process timed out in 6481ms, After SMT, problems are : Problem set: 0 solved, 2103 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 346 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Applied a total of 0 rules in 168 ms. Remains 448 /448 variables (removed 0) and now considering 2552/2552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 448/448 places, 2552/2552 transitions.
RANDOM walk for 1144152 steps (0 resets) in 120004 ms. (9 steps per ms) remains 2072/2103 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2071/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2067/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2065/2067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2065/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2065/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2064/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2064/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2063/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2063/2063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2062/2063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2061/2062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2059/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2056/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2056/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2055/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2054/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2053/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2052/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2052/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2052/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2052/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2052/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2052/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2050/2052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2049/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2049/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 225 ms. (17 steps per ms) remains 2047/2049 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2046/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2046/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2045/2046 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2044/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2041/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2040/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2039/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2038/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2037/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2037 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2035/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2035/2035 properties
Probabilistic random walk after 1000001 steps, saw 657639 distinct states, run finished after 85806 ms. (steps per millisecond=11 ) properties seen :502
[2025-06-01 01:59:41] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2025-06-01 01:59:41] [INFO ] Invariant cache hit.
[2025-06-01 01:59:41] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 231/231 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 3 (OVERLAPS) 217/448 variables, 16/248 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 217/465 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2025-06-01 02:00:11] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:00:11] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:00:11] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 4 ms to minimize.
[2025-06-01 02:00:11] [INFO ] Deduced a trap composed of 66 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:00:12] [INFO ] Deduced a trap composed of 105 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:00:12] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
[2025-06-01 02:00:12] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:00:13] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 02:00:13] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:00:13] [INFO ] Deduced a trap composed of 93 places in 311 ms of which 3 ms to minimize.
[2025-06-01 02:00:13] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:00:14] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 2 ms to minimize.
[2025-06-01 02:00:14] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:00:14] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 3 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 3 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1552 variables, and 493 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 45047 ms.
Refiners :[Domain max(s): 448/448 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/448 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 1533/1533 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 231/231 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 3 (OVERLAPS) 217/448 variables, 16/248 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 217/465 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 4 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 78 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 79 places in 288 ms of which 3 ms to minimize.
[2025-06-01 02:00:43] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:00:43] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:00:43] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:00:44] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 2 ms to minimize.
[2025-06-01 02:00:44] [INFO ] Deduced a trap composed of 85 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:00:44] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:00:45] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:00:45] [INFO ] Deduced a trap composed of 111 places in 290 ms of which 4 ms to minimize.
[2025-06-01 02:00:45] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:00:45] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2025-06-01 02:00:46] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2025-06-01 02:00:47] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:00:47] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:00:48] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:00:48] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:00:48] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:00:49] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:00:49] [INFO ] Deduced a trap composed of 66 places in 289 ms of which 2 ms to minimize.
[2025-06-01 02:00:50] [INFO ] Deduced a trap composed of 94 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:00:50] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2025-06-01 02:00:50] [INFO ] Deduced a trap composed of 97 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:00:51] [INFO ] Deduced a trap composed of 94 places in 252 ms of which 2 ms to minimize.
[2025-06-01 02:00:51] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:00:52] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 2 ms to minimize.
[2025-06-01 02:00:52] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:00:52] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 2 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:00:54] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/533 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 3 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 72 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 103 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 4 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 88 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 2 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 130 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 98 places in 288 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/553 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 122 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 108 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 99 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 94 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 99 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 93 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1552 variables, and 562 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 45035 ms.
Refiners :[Domain max(s): 448/448 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/448 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 0/1533 constraints, Known Traps: 89/89 constraints]
After SMT, in 91086ms problems are : Problem set: 0 solved, 1533 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 231 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 2480
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 2480
Applied a total of 18 rules in 135 ms. Remains 439 /448 variables (removed 9) and now considering 2480/2552 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 439/448 places, 2480/2552 transitions.
RANDOM walk for 1518664 steps (4 resets) in 120005 ms. (12 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1533/1533 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 80236 ms. (steps per millisecond=12 ) properties seen :25
[2025-06-01 02:03:03] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:03:03] [INFO ] Computed 25 invariants in 17 ms
[2025-06-01 02:03:03] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:03:32] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 98 places in 279 ms of which 5 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 4 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 87 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 2 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:03:36] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:03:36] [INFO ] Deduced a trap composed of 106 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:03:36] [INFO ] Deduced a trap composed of 99 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:03:36] [INFO ] Deduced a trap composed of 117 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 123 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 127 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 106 places in 257 ms of which 2 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 2 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 2 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 2 ms to minimize.
[2025-06-01 02:03:40] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:03:40] [INFO ] Deduced a trap composed of 121 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:03:40] [INFO ] Deduced a trap composed of 96 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:03:41] [INFO ] Deduced a trap composed of 92 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:03:41] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 3 ms to minimize.
[2025-06-01 02:03:41] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 5 ms to minimize.
[2025-06-01 02:03:41] [INFO ] Deduced a trap composed of 83 places in 268 ms of which 4 ms to minimize.
[2025-06-01 02:03:42] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 4 ms to minimize.
[2025-06-01 02:03:42] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:03:42] [INFO ] Deduced a trap composed of 101 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:03:43] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:03:43] [INFO ] Deduced a trap composed of 93 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:03:43] [INFO ] Deduced a trap composed of 81 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:03:43] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 119 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 86 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 108 places in 244 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:03:45] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:03:46] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:03:46] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:03:46] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:03:47] [INFO ] Deduced a trap composed of 109 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:03:47] [INFO ] Deduced a trap composed of 128 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:03:47] [INFO ] Deduced a trap composed of 132 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 116 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 120 places in 310 ms of which 3 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 94 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 88 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:03:49] [INFO ] Deduced a trap composed of 140 places in 272 ms of which 2 ms to minimize.
[2025-06-01 02:03:49] [INFO ] Deduced a trap composed of 124 places in 266 ms of which 6 ms to minimize.
[2025-06-01 02:03:49] [INFO ] Deduced a trap composed of 122 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 2 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 135 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 85 places in 295 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:04:03] [INFO ] Deduced a trap composed of 102 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:04:03] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 2 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 108 places in 265 ms of which 2 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 127 places in 266 ms of which 4 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 108 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 55 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 2 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 84 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 90 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 100 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 94 places in 263 ms of which 2 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 99 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:04:10] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:04:10] [INFO ] Deduced a trap composed of 113 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:04:10] [INFO ] Deduced a trap composed of 119 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 2 ms to minimize.
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 99 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 112 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 100 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 93 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 99 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 88 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 94 places in 220 ms of which 2 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 94 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 113 places in 259 ms of which 2 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:04:14] [INFO ] Deduced a trap composed of 103 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:04:14] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:04:14] [INFO ] Deduced a trap composed of 111 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:04:14] [INFO ] Deduced a trap composed of 129 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 109 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 146 places in 261 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:04:17] [INFO ] Deduced a trap composed of 105 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:04:17] [INFO ] Deduced a trap composed of 107 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:04:17] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:04:18] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 2 ms to minimize.
[2025-06-01 02:04:18] [INFO ] Deduced a trap composed of 97 places in 242 ms of which 3 ms to minimize.
[2025-06-01 02:04:18] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:04:18] [INFO ] Deduced a trap composed of 117 places in 235 ms of which 2 ms to minimize.
[2025-06-01 02:04:19] [INFO ] Deduced a trap composed of 104 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:04:19] [INFO ] Deduced a trap composed of 76 places in 246 ms of which 3 ms to minimize.
[2025-06-01 02:04:19] [INFO ] Deduced a trap composed of 101 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:04:19] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 104 places in 269 ms of which 3 ms to minimize.
SMT process timed out in 76401ms, After SMT, problems are : Problem set: 0 solved, 1508 unsolved
Fused 1508 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 112 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 1567271 steps (4 resets) in 120004 ms. (13 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1508/1508 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 81290 ms. (steps per millisecond=12 ) properties seen :0
[2025-06-01 02:06:12] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:06:12] [INFO ] Invariant cache hit.
[2025-06-01 02:06:12] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 4 ms to minimize.
[2025-06-01 02:06:42] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:06:42] [INFO ] Deduced a trap composed of 88 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:06:42] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:06:42] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 2 ms to minimize.
[2025-06-01 02:06:43] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:06:43] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 2 ms to minimize.
[2025-06-01 02:06:44] [INFO ] Deduced a trap composed of 99 places in 285 ms of which 4 ms to minimize.
[2025-06-01 02:06:44] [INFO ] Deduced a trap composed of 104 places in 288 ms of which 4 ms to minimize.
[2025-06-01 02:06:44] [INFO ] Deduced a trap composed of 113 places in 242 ms of which 2 ms to minimize.
[2025-06-01 02:06:45] [INFO ] Deduced a trap composed of 95 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:06:45] [INFO ] Deduced a trap composed of 99 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:06:45] [INFO ] Deduced a trap composed of 97 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:06:46] [INFO ] Deduced a trap composed of 109 places in 284 ms of which 2 ms to minimize.
[2025-06-01 02:06:46] [INFO ] Deduced a trap composed of 124 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:06:46] [INFO ] Deduced a trap composed of 110 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:06:46] [INFO ] Deduced a trap composed of 94 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:06:47] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:06:47] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:06:48] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:06:48] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:06:48] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:06:49] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:06:49] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 3 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 3 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 3 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 83 places in 278 ms of which 2 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:06:51] [INFO ] Deduced a trap composed of 83 places in 263 ms of which 2 ms to minimize.
[2025-06-01 02:06:51] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:06:51] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:06:52] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:06:52] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 98 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 113 places in 241 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 107 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 97 places in 239 ms of which 2 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 103 places in 241 ms of which 2 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 105 places in 256 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:06:56] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 2 ms to minimize.
[2025-06-01 02:06:56] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:06:56] [INFO ] Deduced a trap composed of 98 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:06:57] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:06:57] [INFO ] Deduced a trap composed of 86 places in 279 ms of which 2 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 103 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 98 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 117 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 92 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 81 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 97 places in 269 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 89 places in 272 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:07:14] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 106 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 105 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 96 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 105 places in 266 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 85 places in 259 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 2 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 101 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 2 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 73 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:07:19] [INFO ] Deduced a trap composed of 99 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:07:19] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:07:19] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 100 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:07:22] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:07:23] [INFO ] Deduced a trap composed of 107 places in 263 ms of which 2 ms to minimize.
[2025-06-01 02:07:23] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2025-06-01 02:07:24] [INFO ] Deduced a trap composed of 76 places in 242 ms of which 3 ms to minimize.
[2025-06-01 02:07:24] [INFO ] Deduced a trap composed of 90 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:07:24] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:07:24] [INFO ] Deduced a trap composed of 89 places in 285 ms of which 2 ms to minimize.
[2025-06-01 02:07:25] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:07:25] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:07:25] [INFO ] Deduced a trap composed of 105 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:07:25] [INFO ] Deduced a trap composed of 108 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:07:26] [INFO ] Deduced a trap composed of 84 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:07:26] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:07:26] [INFO ] Deduced a trap composed of 93 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:07:27] [INFO ] Deduced a trap composed of 129 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:07:27] [INFO ] Deduced a trap composed of 111 places in 287 ms of which 2 ms to minimize.
[2025-06-01 02:07:27] [INFO ] Deduced a trap composed of 110 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:07:27] [INFO ] Deduced a trap composed of 67 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:07:28] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 2 ms to minimize.
[2025-06-01 02:07:28] [INFO ] Deduced a trap composed of 112 places in 290 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:07:29] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2025-06-01 02:07:30] [INFO ] Deduced a trap composed of 101 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:07:31] [INFO ] Deduced a trap composed of 98 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:07:31] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:07:31] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:07:31] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:07:32] [INFO ] Deduced a trap composed of 98 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:07:32] [INFO ] Deduced a trap composed of 84 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:07:32] [INFO ] Deduced a trap composed of 106 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:07:33] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:07:33] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:07:33] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:07:33] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 2 ms to minimize.
[2025-06-01 02:07:34] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:07:34] [INFO ] Deduced a trap composed of 83 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:07:34] [INFO ] Deduced a trap composed of 104 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:07:35] [INFO ] Deduced a trap composed of 91 places in 283 ms of which 2 ms to minimize.
[2025-06-01 02:07:35] [INFO ] Deduced a trap composed of 100 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:07:35] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2025-06-01 02:07:35] [INFO ] Deduced a trap composed of 121 places in 255 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 145 constraints, problems are : Problem set: 0 solved, 1508 unsolved in 90037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 1508/1508 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 120/145 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:07:55] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:07:55] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:07:55] [INFO ] Deduced a trap composed of 101 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:07:56] [INFO ] Deduced a trap composed of 126 places in 272 ms of which 2 ms to minimize.
[2025-06-01 02:07:56] [INFO ] Deduced a trap composed of 88 places in 273 ms of which 2 ms to minimize.
[2025-06-01 02:07:56] [INFO ] Deduced a trap composed of 110 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:07:57] [INFO ] Deduced a trap composed of 100 places in 270 ms of which 2 ms to minimize.
[2025-06-01 02:07:57] [INFO ] Deduced a trap composed of 110 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:07:57] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 2 ms to minimize.
[2025-06-01 02:07:58] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:07:58] [INFO ] Deduced a trap composed of 92 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:07:58] [INFO ] Deduced a trap composed of 102 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:07:59] [INFO ] Deduced a trap composed of 104 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:07:59] [INFO ] Deduced a trap composed of 99 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:07:59] [INFO ] Deduced a trap composed of 134 places in 250 ms of which 2 ms to minimize.
[2025-06-01 02:07:59] [INFO ] Deduced a trap composed of 125 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:08:00] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:08:00] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:08:00] [INFO ] Deduced a trap composed of 89 places in 247 ms of which 3 ms to minimize.
[2025-06-01 02:08:00] [INFO ] Deduced a trap composed of 84 places in 257 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:04] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:08:04] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 2 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 97 places in 237 ms of which 2 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 89 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 91 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 92 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 119 places in 259 ms of which 2 ms to minimize.
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 106 places in 254 ms of which 2 ms to minimize.
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 106 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 114 places in 232 ms of which 3 ms to minimize.
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 99 places in 294 ms of which 2 ms to minimize.
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 2 ms to minimize.
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 125 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 110 places in 291 ms of which 2 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 105 places in 298 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 97 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 118 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 89 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 123 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 115 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 84 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 95 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:08:16] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:08:16] [INFO ] Deduced a trap composed of 89 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:08:16] [INFO ] Deduced a trap composed of 109 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 115 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 82 places in 273 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 92 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 5 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 126 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 4 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 95 places in 238 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 71 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 96 places in 269 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 90 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 2 ms to minimize.
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 95 places in 276 ms of which 2 ms to minimize.
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 104 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 80 places in 251 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 91 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 92 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 92 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 97 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 90 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 104 places in 253 ms of which 2 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 80 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 3 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 81 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 73 places in 295 ms of which 2 ms to minimize.
[2025-06-01 02:08:36] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:08:36] [INFO ] Deduced a trap composed of 72 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:08:36] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:08:37] [INFO ] Deduced a trap composed of 112 places in 267 ms of which 2 ms to minimize.
[2025-06-01 02:08:37] [INFO ] Deduced a trap composed of 124 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:08:37] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:08:38] [INFO ] Deduced a trap composed of 78 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:08:38] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 2 ms to minimize.
[2025-06-01 02:08:38] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:08:38] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:08:39] [INFO ] Deduced a trap composed of 62 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:08:39] [INFO ] Deduced a trap composed of 98 places in 246 ms of which 2 ms to minimize.
[2025-06-01 02:08:39] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 2 ms to minimize.
[2025-06-01 02:08:40] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 2 ms to minimize.
[2025-06-01 02:08:40] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 3 ms to minimize.
[2025-06-01 02:08:40] [INFO ] Deduced a trap composed of 63 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:08:41] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 2 ms to minimize.
[2025-06-01 02:08:41] [INFO ] Deduced a trap composed of 104 places in 266 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:44] [INFO ] Deduced a trap composed of 142 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:08:44] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:08:45] [INFO ] Deduced a trap composed of 103 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:08:45] [INFO ] Deduced a trap composed of 72 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:08:45] [INFO ] Deduced a trap composed of 113 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:08:46] [INFO ] Deduced a trap composed of 110 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:08:46] [INFO ] Deduced a trap composed of 110 places in 266 ms of which 2 ms to minimize.
[2025-06-01 02:08:46] [INFO ] Deduced a trap composed of 99 places in 262 ms of which 2 ms to minimize.
[2025-06-01 02:08:46] [INFO ] Deduced a trap composed of 122 places in 243 ms of which 3 ms to minimize.
[2025-06-01 02:08:47] [INFO ] Deduced a trap composed of 95 places in 239 ms of which 2 ms to minimize.
[2025-06-01 02:08:47] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 3 ms to minimize.
[2025-06-01 02:08:47] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:08:48] [INFO ] Deduced a trap composed of 97 places in 235 ms of which 3 ms to minimize.
[2025-06-01 02:08:48] [INFO ] Deduced a trap composed of 108 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:08:48] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:08:48] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:08:49] [INFO ] Deduced a trap composed of 110 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:08:49] [INFO ] Deduced a trap composed of 84 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:08:49] [INFO ] Deduced a trap composed of 99 places in 262 ms of which 2 ms to minimize.
[2025-06-01 02:08:50] [INFO ] Deduced a trap composed of 85 places in 267 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:08:52] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 2 ms to minimize.
[2025-06-01 02:08:53] [INFO ] Deduced a trap composed of 100 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:08:53] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:08:53] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 2 ms to minimize.
[2025-06-01 02:08:53] [INFO ] Deduced a trap composed of 103 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 94 places in 279 ms of which 2 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 93 places in 270 ms of which 2 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 128 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:08:55] [INFO ] Deduced a trap composed of 91 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:08:55] [INFO ] Deduced a trap composed of 99 places in 274 ms of which 2 ms to minimize.
[2025-06-01 02:08:55] [INFO ] Deduced a trap composed of 95 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:08:55] [INFO ] Deduced a trap composed of 105 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 109 places in 253 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 117 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 118 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 2 ms to minimize.
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 2 ms to minimize.
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 114 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 110 places in 256 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 115 places in 292 ms of which 2 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 91 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:09:02] [INFO ] Deduced a trap composed of 90 places in 236 ms of which 2 ms to minimize.
[2025-06-01 02:09:02] [INFO ] Deduced a trap composed of 110 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:09:02] [INFO ] Deduced a trap composed of 96 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 108 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 108 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 114 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 110 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 89 places in 251 ms of which 3 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:09:05] [INFO ] Deduced a trap composed of 92 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:09:05] [INFO ] Deduced a trap composed of 116 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:09:05] [INFO ] Deduced a trap composed of 123 places in 251 ms of which 2 ms to minimize.
[2025-06-01 02:09:06] [INFO ] Deduced a trap composed of 101 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:09:06] [INFO ] Deduced a trap composed of 99 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:09:06] [INFO ] Deduced a trap composed of 108 places in 290 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:09:09] [INFO ] Deduced a trap composed of 104 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:09:10] [INFO ] Deduced a trap composed of 112 places in 257 ms of which 2 ms to minimize.
[2025-06-01 02:09:10] [INFO ] Deduced a trap composed of 104 places in 235 ms of which 3 ms to minimize.
[2025-06-01 02:09:10] [INFO ] Deduced a trap composed of 92 places in 238 ms of which 2 ms to minimize.
[2025-06-01 02:09:10] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:09:11] [INFO ] Deduced a trap composed of 87 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:09:11] [INFO ] Deduced a trap composed of 94 places in 225 ms of which 2 ms to minimize.
[2025-06-01 02:09:11] [INFO ] Deduced a trap composed of 91 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:09:12] [INFO ] Deduced a trap composed of 110 places in 273 ms of which 2 ms to minimize.
[2025-06-01 02:09:12] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 4 ms to minimize.
[2025-06-01 02:09:12] [INFO ] Deduced a trap composed of 77 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:09:13] [INFO ] Deduced a trap composed of 135 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:09:13] [INFO ] Deduced a trap composed of 95 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:09:13] [INFO ] Deduced a trap composed of 86 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:09:14] [INFO ] Deduced a trap composed of 93 places in 278 ms of which 3 ms to minimize.
SMT process timed out in 181279ms, After SMT, problems are : Problem set: 0 solved, 1508 unsolved
Fused 1508 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 79 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 77 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2025-06-01 02:09:14] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:09:14] [INFO ] Invariant cache hit.
[2025-06-01 02:09:14] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-01 02:09:14] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:09:14] [INFO ] Invariant cache hit.
[2025-06-01 02:09:14] [INFO ] State equation strengthened by 613 read => feed constraints.
[2025-06-01 02:09:15] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2025-06-01 02:09:15] [INFO ] Redundant transitions in 129 ms returned []
Running 2472 sub problems to find dead transitions.
[2025-06-01 02:09:15] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:09:15] [INFO ] Invariant cache hit.
[2025-06-01 02:09:15] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 76 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 94 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 76 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 101 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:09:44] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 46 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 2472/2472 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:09:54] [INFO ] Deduced a trap composed of 92 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 109 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 86 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 84 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 100 places in 249 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 90 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 59 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 82 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 82 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:09:58] [INFO ] Deduced a trap composed of 100 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:09:58] [INFO ] Deduced a trap composed of 85 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:09:58] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:09:58] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 2 ms to minimize.
[2025-06-01 02:09:59] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:09:59] [INFO ] Deduced a trap composed of 113 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:09:59] [INFO ] Deduced a trap composed of 96 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:10:00] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:10:00] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:10:06] [INFO ] Deduced a trap composed of 75 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:10:06] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:10:07] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:10:07] [INFO ] Deduced a trap composed of 90 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:10:08] [INFO ] Deduced a trap composed of 99 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:10:08] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 2 ms to minimize.
[2025-06-01 02:10:08] [INFO ] Deduced a trap composed of 106 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:10:09] [INFO ] Deduced a trap composed of 103 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:10:09] [INFO ] Deduced a trap composed of 107 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:10:09] [INFO ] Deduced a trap composed of 108 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:10:09] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:10:10] [INFO ] Deduced a trap composed of 114 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:10:10] [INFO ] Deduced a trap composed of 114 places in 288 ms of which 3 ms to minimize.
[2025-06-01 02:10:10] [INFO ] Deduced a trap composed of 116 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:10:11] [INFO ] Deduced a trap composed of 107 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:10:11] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:10:11] [INFO ] Deduced a trap composed of 125 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:10:12] [INFO ] Deduced a trap composed of 127 places in 269 ms of which 2 ms to minimize.
[2025-06-01 02:10:12] [INFO ] Deduced a trap composed of 119 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:10:12] [INFO ] Deduced a trap composed of 116 places in 288 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1471 variables, and 86 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 0/2472 constraints, Known Traps: 61/61 constraints]
After SMT, in 61502ms problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 61528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62916 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 6202 ms. (64 steps per ms) remains 102/220 properties
Running SMT prover for 102 properties.
[2025-06-01 02:10:19] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:10:19] [INFO ] Invariant cache hit.
[2025-06-01 02:10:19] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-01 02:10:19] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 02:10:19] [INFO ] After 344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :102
[2025-06-01 02:10:19] [INFO ] State equation strengthened by 613 read => feed constraints.
[2025-06-01 02:10:20] [INFO ] After 562ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :102
TRAPS : Iteration 0
[2025-06-01 02:10:26] [INFO ] After 6574ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:102
[2025-06-01 02:10:26] [INFO ] After 7101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:102
[2025-06-01 02:10:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-01 02:10:26] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 02:10:26] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :102
[2025-06-01 02:10:27] [INFO ] After 656ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :102
TRAPS : Iteration 0
[2025-06-01 02:10:27] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:10:27] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1538 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:10:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 662 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 650 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 2 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 645 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 2 ms to minimize.
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:10:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 619 ms
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 462 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:10:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 02:10:38] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2025-06-01 02:10:38] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:10:38] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:10:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
TRAPS : Iteration 1
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 2 ms to minimize.
[2025-06-01 02:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-06-01 02:10:42] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-01 02:10:42] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2025-06-01 02:10:45] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 2
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
TRAPS : Iteration 3
[2025-06-01 02:10:57] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
TRAPS : Iteration 4
[2025-06-01 02:11:07] [INFO ] After 40785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :102
[2025-06-01 02:11:08] [INFO ] After 42287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :102
RANDOM walk for 609523 steps (0 resets) in 120004 ms. (5 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1508/1508 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 82597 ms. (steps per millisecond=12 ) properties seen :0
[2025-06-01 02:13:02] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:13:02] [INFO ] Invariant cache hit.
[2025-06-01 02:13:02] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 3 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 2 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 88 places in 273 ms of which 2 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 2 ms to minimize.
[2025-06-01 02:13:32] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 3 ms to minimize.
[2025-06-01 02:13:32] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:13:32] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 2 ms to minimize.
[2025-06-01 02:13:33] [INFO ] Deduced a trap composed of 99 places in 284 ms of which 4 ms to minimize.
[2025-06-01 02:13:33] [INFO ] Deduced a trap composed of 104 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:13:34] [INFO ] Deduced a trap composed of 113 places in 242 ms of which 2 ms to minimize.
[2025-06-01 02:13:34] [INFO ] Deduced a trap composed of 95 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:13:34] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 97 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 109 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 124 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 94 places in 247 ms of which 3 ms to minimize.
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
[2025-06-01 02:13:38] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:13:38] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 92 places in 234 ms of which 3 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 2 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 2 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 2 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 2 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 113 places in 234 ms of which 3 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 107 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 97 places in 234 ms of which 3 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 103 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 105 places in 245 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:13:44] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:13:45] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:13:45] [INFO ] Deduced a trap composed of 96 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:13:45] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 2 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 98 places in 280 ms of which 2 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 86 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 98 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 115 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 117 places in 275 ms of which 2 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 92 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 97 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 105 places in 247 ms of which 3 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 92 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 96 places in 274 ms of which 3 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 105 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 85 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:14:07] [INFO ] Deduced a trap composed of 101 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:14:07] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:14:07] [INFO ] Deduced a trap composed of 92 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:14:08] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:14:08] [INFO ] Deduced a trap composed of 99 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:14:08] [INFO ] Deduced a trap composed of 73 places in 300 ms of which 3 ms to minimize.
[2025-06-01 02:14:09] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 2 ms to minimize.
[2025-06-01 02:14:09] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:14:09] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:14:10] [INFO ] Deduced a trap composed of 100 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:14:10] [INFO ] Deduced a trap composed of 93 places in 269 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:14:11] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 6 ms to minimize.
[2025-06-01 02:14:12] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:14:13] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 2 ms to minimize.
[2025-06-01 02:14:13] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:14:13] [INFO ] Deduced a trap composed of 90 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:14:13] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 2 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 89 places in 266 ms of which 2 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 101 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:14:15] [INFO ] Deduced a trap composed of 108 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:14:15] [INFO ] Deduced a trap composed of 84 places in 265 ms of which 2 ms to minimize.
[2025-06-01 02:14:15] [INFO ] Deduced a trap composed of 87 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 93 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 129 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 111 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 110 places in 305 ms of which 2 ms to minimize.
[2025-06-01 02:14:17] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:14:17] [INFO ] Deduced a trap composed of 86 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:14:17] [INFO ] Deduced a trap composed of 112 places in 282 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:14:19] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2025-06-01 02:14:20] [INFO ] Deduced a trap composed of 101 places in 293 ms of which 2 ms to minimize.
[2025-06-01 02:14:20] [INFO ] Deduced a trap composed of 98 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:14:20] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:14:21] [INFO ] Deduced a trap composed of 83 places in 261 ms of which 2 ms to minimize.
[2025-06-01 02:14:21] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:14:21] [INFO ] Deduced a trap composed of 98 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:14:22] [INFO ] Deduced a trap composed of 84 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:14:22] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:14:22] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:14:22] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 2 ms to minimize.
[2025-06-01 02:14:23] [INFO ] Deduced a trap composed of 85 places in 247 ms of which 3 ms to minimize.
[2025-06-01 02:14:23] [INFO ] Deduced a trap composed of 84 places in 237 ms of which 2 ms to minimize.
[2025-06-01 02:14:23] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:14:23] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 2 ms to minimize.
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 104 places in 262 ms of which 2 ms to minimize.
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 100 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:14:25] [INFO ] Deduced a trap composed of 121 places in 264 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:14:39] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:14:39] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:14:39] [INFO ] Deduced a trap composed of 75 places in 286 ms of which 2 ms to minimize.
[2025-06-01 02:14:40] [INFO ] Deduced a trap composed of 79 places in 299 ms of which 3 ms to minimize.
[2025-06-01 02:14:40] [INFO ] Deduced a trap composed of 110 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:14:40] [INFO ] Deduced a trap composed of 103 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:14:40] [INFO ] Deduced a trap composed of 71 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:14:41] [INFO ] Deduced a trap composed of 78 places in 283 ms of which 2 ms to minimize.
[2025-06-01 02:14:41] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:14:41] [INFO ] Deduced a trap composed of 114 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 94 places in 286 ms of which 2 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 96 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 89 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 106 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 2 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 92 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 103 places in 272 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 83 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 75 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 80 places in 247 ms of which 2 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:14:48] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 2 ms to minimize.
[2025-06-01 02:14:48] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 2 ms to minimize.
SMT process timed out in 106208ms, After SMT, problems are : Problem set: 0 solved, 1508 unsolved
Fused 1508 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 80 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 71 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2025-06-01 02:14:48] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:14:48] [INFO ] Invariant cache hit.
[2025-06-01 02:14:48] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-01 02:14:48] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:14:48] [INFO ] Invariant cache hit.
[2025-06-01 02:14:49] [INFO ] State equation strengthened by 613 read => feed constraints.
[2025-06-01 02:14:50] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
[2025-06-01 02:14:50] [INFO ] Redundant transitions in 62 ms returned []
Running 2472 sub problems to find dead transitions.
[2025-06-01 02:14:50] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:14:50] [INFO ] Invariant cache hit.
[2025-06-01 02:14:50] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:15:09] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 2 ms to minimize.
[2025-06-01 02:15:09] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 02:15:10] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:15:11] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2025-06-01 02:15:11] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 3 ms to minimize.
[2025-06-01 02:15:11] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 2 ms to minimize.
[2025-06-01 02:15:11] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:15:11] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:15:17] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:15:18] [INFO ] Deduced a trap composed of 82 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:15:18] [INFO ] Deduced a trap composed of 94 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:15:18] [INFO ] Deduced a trap composed of 76 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:15:19] [INFO ] Deduced a trap composed of 101 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:15:19] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:15:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 46 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 2472/2472 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:15:29] [INFO ] Deduced a trap composed of 92 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:15:29] [INFO ] Deduced a trap composed of 109 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 86 places in 287 ms of which 2 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 84 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 4 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 100 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 2 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 2 ms to minimize.
[2025-06-01 02:15:32] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:15:32] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:15:32] [INFO ] Deduced a trap composed of 100 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 85 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 86 places in 269 ms of which 2 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 87 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 2 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 113 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 96 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 3 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2025-06-01 02:15:41] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:15:41] [INFO ] Deduced a trap composed of 57 places in 286 ms of which 3 ms to minimize.
[2025-06-01 02:15:42] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:15:42] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:15:42] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 3 ms to minimize.
[2025-06-01 02:15:43] [INFO ] Deduced a trap composed of 122 places in 247 ms of which 3 ms to minimize.
[2025-06-01 02:15:43] [INFO ] Deduced a trap composed of 106 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:15:43] [INFO ] Deduced a trap composed of 103 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:15:44] [INFO ] Deduced a trap composed of 107 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:15:44] [INFO ] Deduced a trap composed of 108 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:15:44] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:15:45] [INFO ] Deduced a trap composed of 114 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:15:45] [INFO ] Deduced a trap composed of 114 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:15:45] [INFO ] Deduced a trap composed of 116 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:15:46] [INFO ] Deduced a trap composed of 107 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:15:46] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 3 ms to minimize.
[2025-06-01 02:15:46] [INFO ] Deduced a trap composed of 125 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:15:46] [INFO ] Deduced a trap composed of 127 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:15:47] [INFO ] Deduced a trap composed of 119 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:15:47] [INFO ] Deduced a trap composed of 116 places in 276 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1471 variables, and 86 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 0/2472 constraints, Known Traps: 61/61 constraints]
After SMT, in 61580ms problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 61602ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63109 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 12853 ms. (31 steps per ms) remains 106/220 properties
Running SMT prover for 106 properties.
[2025-06-01 02:15:55] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:15:55] [INFO ] Invariant cache hit.
[2025-06-01 02:15:55] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-01 02:15:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 02:15:56] [INFO ] After 387ms SMT Verify possible using state equation in real domain returned unsat :0 sat :106
[2025-06-01 02:15:56] [INFO ] State equation strengthened by 613 read => feed constraints.
[2025-06-01 02:15:56] [INFO ] After 606ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :106
TRAPS : Iteration 0
[2025-06-01 02:16:03] [INFO ] After 7054ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:106
[2025-06-01 02:16:03] [INFO ] After 7617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:106
[2025-06-01 02:16:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-01 02:16:03] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 02:16:03] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :106
[2025-06-01 02:16:04] [INFO ] After 802ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :106
TRAPS : Iteration 0
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:16:05] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:16:05] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:16:05] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:16:06] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:16:06] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 2 ms to minimize.
[2025-06-01 02:16:06] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2025-06-01 02:16:06] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 3 ms to minimize.
[2025-06-01 02:16:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2436 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2025-06-01 02:16:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1230 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 103 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:16:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2025-06-01 02:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-01 02:16:10] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 3 ms to minimize.
[2025-06-01 02:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2025-06-01 02:16:10] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1066 ms
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 112 places in 213 ms of which 3 ms to minimize.
[2025-06-01 02:16:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 107 places in 222 ms of which 2 ms to minimize.
[2025-06-01 02:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 585 ms
[2025-06-01 02:16:14] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:16:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-06-01 02:16:15] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:16:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2025-06-01 02:16:15] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:16:15] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:16:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2025-06-01 02:16:15] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2025-06-01 02:16:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-01 02:16:15] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:16:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-01 02:16:16] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:16:16] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2025-06-01 02:16:16] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2025-06-01 02:16:17] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:16:17] [INFO ] Deduced a trap composed of 92 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:16:17] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:16:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 862 ms
[2025-06-01 02:16:17] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2025-06-01 02:16:18] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2025-06-01 02:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 02:16:18] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:16:18] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:16:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-06-01 02:16:19] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 11 ms to minimize.
[2025-06-01 02:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-01 02:16:21] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-01 02:16:21] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2025-06-01 02:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
TRAPS : Iteration 1
[2025-06-01 02:16:24] [INFO ] Deduced a trap composed of 93 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2025-06-01 02:16:25] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2025-06-01 02:16:25] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 02:16:26] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2025-06-01 02:16:26] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
TRAPS : Iteration 2
[2025-06-01 02:16:30] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 3 ms to minimize.
[2025-06-01 02:16:30] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:16:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
TRAPS : Iteration 3
[2025-06-01 02:16:40] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
TRAPS : Iteration 4
[2025-06-01 02:16:49] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
TRAPS : Iteration 5
[2025-06-01 02:16:57] [INFO ] After 53378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :106
[2025-06-01 02:16:57] [INFO ] After 54889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :106
RANDOM walk for 568 steps (0 resets) in 13 ms. (40 steps per ms) remains 0/1 properties
RANDOM walk for 966 steps (0 resets) in 13 ms. (69 steps per ms) remains 0/1 properties
RANDOM walk for 1636 steps (0 resets) in 17 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 1241 steps (0 resets) in 15 ms. (77 steps per ms) remains 0/1 properties
RANDOM walk for 2329 steps (0 resets) in 24 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 1674 steps (0 resets) in 18 ms. (88 steps per ms) remains 0/1 properties
RANDOM walk for 2381 steps (0 resets) in 23 ms. (99 steps per ms) remains 0/1 properties
RANDOM walk for 2185 steps (0 resets) in 19 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 2884 steps (0 resets) in 31 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 2880 steps (0 resets) in 24 ms. (115 steps per ms) remains 0/1 properties
RANDOM walk for 3403 steps (0 resets) in 18 ms. (179 steps per ms) remains 0/1 properties
RANDOM walk for 3009 steps (0 resets) in 21 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 134 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 3657 steps (0 resets) in 25 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 1738 steps (0 resets) in 13 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 2165 steps (0 resets) in 22 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 2759 steps (0 resets) in 20 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 3100 steps (0 resets) in 21 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 3576 steps (0 resets) in 23 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 258 steps (0 resets) in 5 ms. (43 steps per ms) remains 0/1 properties
RANDOM walk for 578 steps (0 resets) in 10 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 2082 steps (0 resets) in 13 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 2542 steps (0 resets) in 17 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 3260 steps (0 resets) in 21 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 3672 steps (0 resets) in 22 ms. (159 steps per ms) remains 0/1 properties
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 587 steps (0 resets) in 21 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 924 steps (0 resets) in 12 ms. (71 steps per ms) remains 0/1 properties
RANDOM walk for 2501 steps (0 resets) in 34 ms. (71 steps per ms) remains 0/1 properties
RANDOM walk for 3198 steps (0 resets) in 22 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 3477 steps (0 resets) in 22 ms. (151 steps per ms) remains 0/1 properties
RANDOM walk for 120 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 523 steps (0 resets) in 8 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 1406 steps (0 resets) in 15 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 1585 steps (0 resets) in 13 ms. (113 steps per ms) remains 0/1 properties
RANDOM walk for 2947 steps (0 resets) in 29 ms. (98 steps per ms) remains 0/1 properties
RANDOM walk for 3369 steps (0 resets) in 22 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 98 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
RANDOM walk for 467 steps (0 resets) in 9 ms. (46 steps per ms) remains 0/1 properties
RANDOM walk for 1042 steps (0 resets) in 14 ms. (69 steps per ms) remains 0/1 properties
RANDOM walk for 1552 steps (0 resets) in 12 ms. (119 steps per ms) remains 0/1 properties
RANDOM walk for 2033 steps (0 resets) in 16 ms. (119 steps per ms) remains 0/1 properties
RANDOM walk for 3814 steps (0 resets) in 27 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 78 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 586 steps (0 resets) in 9 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 1044 steps (0 resets) in 11 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 1392 steps (0 resets) in 10 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 651 steps (0 resets) in 10 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 2098 steps (0 resets) in 21 ms. (95 steps per ms) remains 0/1 properties
RANDOM walk for 2775 steps (0 resets) in 20 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 1053 steps (0 resets) in 11 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 1494 steps (0 resets) in 13 ms. (106 steps per ms) remains 0/1 properties
RANDOM walk for 2103 steps (0 resets) in 18 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 2836 steps (0 resets) in 21 ms. (128 steps per ms) remains 0/1 properties
RANDOM walk for 3279 steps (0 resets) in 24 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 30072 steps (7 resets) in 166 ms. (180 steps per ms) remains 0/1 properties
RANDOM walk for 586 steps (0 resets) in 8 ms. (65 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 958 steps (0 resets) in 12 ms. (73 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1546 steps (0 resets) in 14 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 61 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 2173 steps (0 resets) in 19 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 2531 steps (0 resets) in 19 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 2905 steps (0 resets) in 23 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 3582 steps (0 resets) in 26 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 26772 steps (6 resets) in 124 ms. (214 steps per ms) remains 0/1 properties
RANDOM walk for 105 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 453114 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 453114 steps, saw 305495 distinct states, run finished after 3010 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:17:02] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:17:02] [INFO ] Invariant cache hit.
[2025-06-01 02:17:02] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2025-06-01 02:17:03] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:17:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2172ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3207 steps, including 189 resets, run visited all 1 properties in 51 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 61 ms.
RANDOM walk for 40000 steps (8 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 451215 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451215 steps, saw 304360 distinct states, run finished after 3002 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:17:07] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:17:07] [INFO ] Invariant cache hit.
[2025-06-01 02:17:07] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:08] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:17:08] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:17:08] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:17:08] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:17:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 94 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 500175 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 500175 steps, saw 262451 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
[2025-06-01 02:17:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:17:12] [INFO ] Computed 25 invariants in 9 ms
[2025-06-01 02:17:12] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 28/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 246/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 28/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:13] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:13] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:17:13] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:17:13] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 246/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:17:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:17:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:17:14] [INFO ] Invariant cache hit.
[2025-06-01 02:17:14] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-01 02:17:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:17:14] [INFO ] Invariant cache hit.
[2025-06-01 02:17:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:17:16] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2025-06-01 02:17:16] [INFO ] Redundant transitions in 153 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:17:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:17:16] [INFO ] Invariant cache hit.
[2025-06-01 02:17:16] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 02:17:31] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:17:32] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2025-06-01 02:17:33] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:17:33] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:17:34] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:17:34] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:17:34] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2025-06-01 02:17:34] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:17:35] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:17:36] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:17:37] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:17:37] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:17:37] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2025-06-01 02:17:37] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:17:37] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:17:38] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:17:38] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:17:38] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:17:39] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:17:39] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:17:39] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:17:39] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:17:40] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:17:40] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 02:17:40] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:17:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:17:40] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:17:41] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:17:41] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:17:52] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:17:52] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:17:52] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:17:55] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:17:55] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:17:57] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:17:58] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:17:58] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:18:00] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2025-06-01 02:18:00] [INFO ] Deduced a trap composed of 60 places in 204 ms of which 2 ms to minimize.
[2025-06-01 02:18:01] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:18:01] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:18:01] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:18:02] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:18:03] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:18:06] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 1 ms to minimize.
[2025-06-01 02:18:06] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:18:14] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:18:14] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:18:14] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:18:15] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:18:17] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 92 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 67/67 constraints]
After SMT, in 61241ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63576 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 67 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2025-06-01 02:18:17] [INFO ] Computed 17 invariants in 0 ms
[2025-06-01 02:18:17] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:18:17] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:18:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:18:17] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:18:17] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:18:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:18:17] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:18:17] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:18:17] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:18:17] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 228 ms.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 457272 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 457272 steps, saw 308245 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:18:20] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:18:20] [INFO ] Computed 25 invariants in 10 ms
[2025-06-01 02:18:21] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:21] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2025-06-01 02:18:22] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2025-06-01 02:18:22] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:18:22] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:18:22] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1968ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 457272 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 457272 steps, saw 308245 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:18:26] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:26] [INFO ] Invariant cache hit.
[2025-06-01 02:18:26] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:26] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 3 ms to minimize.
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:18:28] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:18:28] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:18:28] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2532ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 457380 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 457380 steps, saw 308326 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:18:31] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:31] [INFO ] Invariant cache hit.
[2025-06-01 02:18:31] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:32] [INFO ] Deduced a trap composed of 62 places in 290 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2229ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 74 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 50092 steps, run visited all 1 properties in 315 ms. (steps per millisecond=159 )
Probabilistic random walk after 50092 steps, saw 33955 distinct states, run finished after 319 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 30037 steps (7 resets) in 141 ms. (211 steps per ms) remains 0/1 properties
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464139 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464139 steps, saw 312623 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:18:37] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:37] [INFO ] Invariant cache hit.
[2025-06-01 02:18:37] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:37] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 83 places in 276 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2075ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 72 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 462978 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 462978 steps, saw 311862 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:18:42] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:42] [INFO ] Invariant cache hit.
[2025-06-01 02:18:42] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 83 places in 286 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 2 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2425ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20398 steps, including 484 resets, run visited all 1 properties in 124 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 126 ms.
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435159 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 435159 steps, saw 294016 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
[2025-06-01 02:18:48] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:48] [INFO ] Invariant cache hit.
[2025-06-01 02:18:48] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:48] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:48] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:49] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:18:49] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:18:49] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2610ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 439974 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 439974 steps, saw 297089 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2025-06-01 02:18:54] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:18:54] [INFO ] Invariant cache hit.
[2025-06-01 02:18:54] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 93 places in 296 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 2 ms to minimize.
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 118 places in 290 ms of which 3 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 67 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 283651 steps, run visited all 1 properties in 1768 ms. (steps per millisecond=160 )
Probabilistic random walk after 283651 steps, saw 161256 distinct states, run finished after 1768 ms. (steps per millisecond=160 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435528 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 435528 steps, saw 294301 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2025-06-01 02:19:01] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:19:01] [INFO ] Invariant cache hit.
[2025-06-01 02:19:01] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:02] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:19:02] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:19:02] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:19:03] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 71 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42388 steps, run visited all 1 properties in 264 ms. (steps per millisecond=160 )
Probabilistic random walk after 42388 steps, saw 29288 distinct states, run finished after 264 ms. (steps per millisecond=160 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 452961 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452961 steps, saw 305411 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:19:06] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:19:06] [INFO ] Invariant cache hit.
[2025-06-01 02:19:06] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 79 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 25369 steps, run visited all 1 properties in 163 ms. (steps per millisecond=155 )
Probabilistic random walk after 25369 steps, saw 18443 distinct states, run finished after 164 ms. (steps per millisecond=154 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125332 steps, run visited all 1 properties in 857 ms. (steps per millisecond=146 )
Probabilistic random walk after 125332 steps, saw 90604 distinct states, run finished after 857 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 30241 steps (6 resets) in 149 ms. (201 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 433836 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 433836 steps, saw 293223 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2025-06-01 02:19:12] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:19:12] [INFO ] Invariant cache hit.
[2025-06-01 02:19:12] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:13] [INFO ] Deduced a trap composed of 102 places in 247 ms of which 2 ms to minimize.
[2025-06-01 02:19:13] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:14] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 89 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437769 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 437769 steps, saw 295814 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2025-06-01 02:19:17] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:19:17] [INFO ] Invariant cache hit.
[2025-06-01 02:19:17] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:17] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:18] [INFO ] Deduced a trap composed of 112 places in 262 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 68 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 491967 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 491967 steps, saw 258286 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2025-06-01 02:19:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:19:23] [INFO ] Computed 25 invariants in 2 ms
[2025-06-01 02:19:23] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2304ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 836 steps, including 45 resets, run visited all 1 properties in 5 ms. (steps per millisecond=167 )
Parikh walk visited 1 properties in 6 ms.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443808 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443808 steps, saw 299589 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2025-06-01 02:19:28] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:19:28] [INFO ] Computed 25 invariants in 14 ms
[2025-06-01 02:19:28] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 3 ms to minimize.
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1873 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2507ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13390 steps, including 448 resets, run visited all 1 properties in 60 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 59 ms.
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 216349 steps, run visited all 1 properties in 1477 ms. (steps per millisecond=146 )
Probabilistic random walk after 216349 steps, saw 151963 distinct states, run finished after 1478 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409158 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409158 steps, saw 277400 distinct states, run finished after 3004 ms. (steps per millisecond=136 ) properties seen :0
[2025-06-01 02:19:35] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:19:35] [INFO ] Invariant cache hit.
[2025-06-01 02:19:35] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 2/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2871ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 67 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505764 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505764 steps, saw 265033 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2025-06-01 02:19:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:19:42] [INFO ] Computed 25 invariants in 5 ms
[2025-06-01 02:19:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:19:43] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2025-06-01 02:19:43] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 2 ms to minimize.
[2025-06-01 02:19:43] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1568ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:19:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:19:43] [INFO ] Invariant cache hit.
[2025-06-01 02:19:44] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-01 02:19:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:19:44] [INFO ] Invariant cache hit.
[2025-06-01 02:19:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:19:45] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2025-06-01 02:19:46] [INFO ] Redundant transitions in 46 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:19:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:19:46] [INFO ] Invariant cache hit.
[2025-06-01 02:19:46] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 02:20:01] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:20:03] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:20:03] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:20:03] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 2 ms to minimize.
[2025-06-01 02:20:05] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:20:05] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:20:07] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:20:07] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2025-06-01 02:20:07] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:20:08] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2025-06-01 02:20:08] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:20:08] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:20:08] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:20:09] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:20:09] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:20:09] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:20:10] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:20:10] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:20:10] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:20:10] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:20:10] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:20:12] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:20:27] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:20:30] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 2 ms to minimize.
[2025-06-01 02:20:30] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:20:31] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:20:31] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:20:31] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 3 ms to minimize.
[2025-06-01 02:20:32] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:20:32] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:20:32] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:20:32] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:20:33] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:20:33] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:20:33] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:20:43] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 02:20:43] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:20:45] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 92 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 67/67 constraints]
After SMT, in 61209ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63574 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 32 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2025-06-01 02:20:47] [INFO ] Computed 17 invariants in 0 ms
[2025-06-01 02:20:47] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:20:47] [INFO ] After 257ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:20:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:20:47] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:20:47] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:20:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:20:47] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:20:47] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:20:47] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:20:47] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 454 ms.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 466317 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 466317 steps, saw 313930 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-01 02:20:50] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:20:50] [INFO ] Computed 25 invariants in 5 ms
[2025-06-01 02:20:50] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:20:52] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1414 steps, including 63 resets, run visited all 1 properties in 8 ms. (steps per millisecond=176 )
Parikh walk visited 1 properties in 7 ms.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 310453 steps, run visited all 1 properties in 2034 ms. (steps per millisecond=152 )
Probabilistic random walk after 310453 steps, saw 213638 distinct states, run finished after 2034 ms. (steps per millisecond=152 ) properties seen :1
RANDOM walk for 31437 steps (6 resets) in 139 ms. (224 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464094 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464094 steps, saw 312589 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:20:57] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:20:57] [INFO ] Invariant cache hit.
[2025-06-01 02:20:57] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:20:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:20:58] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 121939 steps, run visited all 1 properties in 771 ms. (steps per millisecond=158 )
Probabilistic random walk after 121939 steps, saw 88261 distinct states, run finished after 772 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 152530 steps, run visited all 1 properties in 970 ms. (steps per millisecond=157 )
Probabilistic random walk after 152530 steps, saw 109091 distinct states, run finished after 970 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 57841 steps, run visited all 1 properties in 364 ms. (steps per millisecond=158 )
Probabilistic random walk after 57841 steps, saw 43343 distinct states, run finished after 364 ms. (steps per millisecond=158 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 470574 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 470574 steps, saw 316648 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2025-06-01 02:21:04] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:04] [INFO ] Invariant cache hit.
[2025-06-01 02:21:04] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:04] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:05] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:21:05] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:21:05] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:06] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 75 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 66877 steps, run visited all 1 properties in 391 ms. (steps per millisecond=171 )
Probabilistic random walk after 66877 steps, saw 43806 distinct states, run finished after 391 ms. (steps per millisecond=171 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 255337 steps, run visited all 1 properties in 1621 ms. (steps per millisecond=157 )
Probabilistic random walk after 255337 steps, saw 177662 distinct states, run finished after 1624 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 236968 steps, run visited all 1 properties in 1514 ms. (steps per millisecond=156 )
Probabilistic random walk after 236968 steps, saw 165541 distinct states, run finished after 1515 ms. (steps per millisecond=156 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 39895 steps, run visited all 1 properties in 255 ms. (steps per millisecond=156 )
Probabilistic random walk after 39895 steps, saw 30366 distinct states, run finished after 255 ms. (steps per millisecond=156 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31660 steps, run visited all 1 properties in 206 ms. (steps per millisecond=153 )
Probabilistic random walk after 31660 steps, saw 24188 distinct states, run finished after 207 ms. (steps per millisecond=152 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 41470 steps, run visited all 1 properties in 263 ms. (steps per millisecond=157 )
Probabilistic random walk after 41470 steps, saw 31542 distinct states, run finished after 263 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467046 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467046 steps, saw 314418 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-01 02:21:14] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:14] [INFO ] Invariant cache hit.
[2025-06-01 02:21:14] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:15] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 2 ms to minimize.
[2025-06-01 02:21:15] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:21:15] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:21:16] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2025-06-01 02:21:16] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:21:16] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 66 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6307 steps, run visited all 1 properties in 38 ms. (steps per millisecond=165 )
Probabilistic random walk after 6307 steps, saw 5034 distinct states, run finished after 39 ms. (steps per millisecond=161 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464076 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464076 steps, saw 312576 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:21:20] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:20] [INFO ] Invariant cache hit.
[2025-06-01 02:21:20] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:20] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:21] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2025-06-01 02:21:21] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:21:21] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:21:21] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1753ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 46 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 205144 steps, run visited all 1 properties in 1305 ms. (steps per millisecond=157 )
Probabilistic random walk after 205144 steps, saw 144594 distinct states, run finished after 1305 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 249595 steps, run visited all 1 properties in 1608 ms. (steps per millisecond=155 )
Probabilistic random walk after 249595 steps, saw 173972 distinct states, run finished after 1608 ms. (steps per millisecond=155 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 68947 steps, run visited all 1 properties in 434 ms. (steps per millisecond=158 )
Probabilistic random walk after 68947 steps, saw 51453 distinct states, run finished after 434 ms. (steps per millisecond=158 ) properties seen :1
RANDOM walk for 39394 steps (8 resets) in 223 ms. (175 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2743 steps, run visited all 1 properties in 20 ms. (steps per millisecond=137 )
Probabilistic random walk after 2743 steps, saw 2310 distinct states, run finished after 20 ms. (steps per millisecond=137 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 102976 steps, run visited all 1 properties in 657 ms. (steps per millisecond=156 )
Probabilistic random walk after 102976 steps, saw 75092 distinct states, run finished after 657 ms. (steps per millisecond=156 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 352897 steps, run visited all 1 properties in 2272 ms. (steps per millisecond=155 )
Probabilistic random walk after 352897 steps, saw 241164 distinct states, run finished after 2273 ms. (steps per millisecond=155 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 365299 steps, run visited all 1 properties in 2351 ms. (steps per millisecond=155 )
Probabilistic random walk after 365299 steps, saw 249342 distinct states, run finished after 2352 ms. (steps per millisecond=155 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463725 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463725 steps, saw 312334 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:21:34] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:34] [INFO ] Invariant cache hit.
[2025-06-01 02:21:34] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:34] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:35] [INFO ] Deduced a trap composed of 111 places in 289 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:36] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 2 ms to minimize.
[2025-06-01 02:21:36] [INFO ] Deduced a trap composed of 100 places in 240 ms of which 2 ms to minimize.
[2025-06-01 02:21:36] [INFO ] Deduced a trap composed of 122 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:21:36] [INFO ] Deduced a trap composed of 95 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:21:37] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 2 ms to minimize.
[2025-06-01 02:21:37] [INFO ] Deduced a trap composed of 109 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:21:37] [INFO ] Deduced a trap composed of 120 places in 264 ms of which 3 ms to minimize.
[2025-06-01 02:21:37] [INFO ] Deduced a trap composed of 115 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:21:38] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:21:38] [INFO ] Deduced a trap composed of 99 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:21:38] [INFO ] Deduced a trap composed of 111 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:21:39] [INFO ] Deduced a trap composed of 103 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:21:39] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:21:39] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 3 ms to minimize.
[2025-06-01 02:21:39] [INFO ] Deduced a trap composed of 101 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:21:40] [INFO ] Deduced a trap composed of 97 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:21:40] [INFO ] Deduced a trap composed of 102 places in 239 ms of which 3 ms to minimize.
[2025-06-01 02:21:40] [INFO ] Deduced a trap composed of 102 places in 232 ms of which 2 ms to minimize.
SMT process timed out in 6255ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 62 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44404 steps, run visited all 1 properties in 252 ms. (steps per millisecond=176 )
Probabilistic random walk after 44404 steps, saw 30493 distinct states, run finished after 253 ms. (steps per millisecond=175 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55222 steps, run visited all 1 properties in 344 ms. (steps per millisecond=160 )
Probabilistic random walk after 55222 steps, saw 41490 distinct states, run finished after 344 ms. (steps per millisecond=160 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 107971 steps, run visited all 1 properties in 677 ms. (steps per millisecond=159 )
Probabilistic random walk after 107971 steps, saw 78544 distinct states, run finished after 678 ms. (steps per millisecond=159 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1672 steps, run visited all 1 properties in 14 ms. (steps per millisecond=119 )
Probabilistic random walk after 1672 steps, saw 1440 distinct states, run finished after 14 ms. (steps per millisecond=119 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 934 steps, run visited all 1 properties in 9 ms. (steps per millisecond=103 )
Probabilistic random walk after 934 steps, saw 817 distinct states, run finished after 10 ms. (steps per millisecond=93 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 177568 steps, run visited all 1 properties in 1239 ms. (steps per millisecond=143 )
Probabilistic random walk after 177568 steps, saw 126126 distinct states, run finished after 1240 ms. (steps per millisecond=143 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 132847 steps, run visited all 1 properties in 864 ms. (steps per millisecond=153 )
Probabilistic random walk after 132847 steps, saw 95688 distinct states, run finished after 865 ms. (steps per millisecond=153 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 457380 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 457380 steps, saw 308326 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:21:47] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:47] [INFO ] Invariant cache hit.
[2025-06-01 02:21:47] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/175 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/281 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/435 variables, 70/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 25/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 294/729 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/743 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/743 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 728/1471 variables, 308/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 541/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/175 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/281 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/435 variables, 70/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 25/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 294/729 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/743 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/743 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/743 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 728/1471 variables, 308/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 541/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 62 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55807 steps, run visited all 1 properties in 348 ms. (steps per millisecond=160 )
Probabilistic random walk after 55807 steps, saw 37430 distinct states, run finished after 348 ms. (steps per millisecond=160 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42955 steps, run visited all 1 properties in 272 ms. (steps per millisecond=157 )
Probabilistic random walk after 42955 steps, saw 32641 distinct states, run finished after 273 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13687 steps, run visited all 1 properties in 89 ms. (steps per millisecond=153 )
Probabilistic random walk after 13687 steps, saw 10769 distinct states, run finished after 89 ms. (steps per millisecond=153 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10825 steps, run visited all 1 properties in 71 ms. (steps per millisecond=152 )
Probabilistic random walk after 10825 steps, saw 8660 distinct states, run finished after 72 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4669 steps, run visited all 1 properties in 31 ms. (steps per millisecond=150 )
Probabilistic random walk after 4669 steps, saw 3888 distinct states, run finished after 31 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 365 steps (0 resets) in 6 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 938 steps (0 resets) in 9 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 1347 steps (0 resets) in 12 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 1901 steps (0 resets) in 12 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 2242 steps (0 resets) in 12 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 2789 steps (0 resets) in 18 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 3417 steps (0 resets) in 20 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 578 steps (0 resets) in 8 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 905 steps (0 resets) in 8 ms. (100 steps per ms) remains 0/1 properties
RANDOM walk for 1384 steps (0 resets) in 10 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 2149 steps (0 resets) in 15 ms. (134 steps per ms) remains 0/1 properties
RANDOM walk for 2507 steps (0 resets) in 17 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 2913 steps (0 resets) in 16 ms. (171 steps per ms) remains 0/1 properties
RANDOM walk for 3388 steps (0 resets) in 20 ms. (161 steps per ms) remains 0/1 properties
RANDOM walk for 4056 steps (0 resets) in 20 ms. (193 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 466281 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 466281 steps, saw 313898 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-01 02:21:53] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2025-06-01 02:21:53] [INFO ] Invariant cache hit.
[2025-06-01 02:21:53] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:54] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:21:55] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:55] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:21:55] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:21:55] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 3/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 63 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512262 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512262 steps, saw 267398 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2025-06-01 02:21:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:21:59] [INFO ] Computed 25 invariants in 5 ms
[2025-06-01 02:21:59] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:21:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:22:00] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:22:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:22:00] [INFO ] Invariant cache hit.
[2025-06-01 02:22:00] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-06-01 02:22:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:22:00] [INFO ] Invariant cache hit.
[2025-06-01 02:22:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:22:02] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2025-06-01 02:22:02] [INFO ] Redundant transitions in 43 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:22:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:22:02] [INFO ] Invariant cache hit.
[2025-06-01 02:22:02] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:22:17] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:22:17] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2025-06-01 02:22:17] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:22:18] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:22:19] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:22:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:22:20] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:22:21] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:22:21] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 2 ms to minimize.
[2025-06-01 02:22:21] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:22:23] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:22:24] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:22:24] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:22:24] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:22:24] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:22:24] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:22:25] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:22:25] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 1 ms to minimize.
[2025-06-01 02:22:25] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:22:26] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:22:26] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:22:26] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:22:26] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:22:27] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:22:27] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2025-06-01 02:22:27] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:22:27] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2025-06-01 02:22:28] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:22:28] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:22:28] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:22:38] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:22:39] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:22:39] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:22:41] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:22:41] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:22:44] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:22:44] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:22:44] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:22:46] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2025-06-01 02:22:47] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 2 ms to minimize.
[2025-06-01 02:22:47] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2025-06-01 02:22:47] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:22:48] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:22:48] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:22:48] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:22:48] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:22:49] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:22:49] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:22:49] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:22:49] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:22:53] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:22:53] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:22:59] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:23:00] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:23:00] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:23:01] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:23:03] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:23:03] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 2 ms to minimize.
SMT process timed out in 61195ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63685 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 18 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:23:03] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:23:03] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:23:04] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:23:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:23:04] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:23:04] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:23:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 02:23:04] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:23:04] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:23:04] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:23:04] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 194 ms.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467577 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467577 steps, saw 314651 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-01 02:23:07] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:23:07] [INFO ] Computed 25 invariants in 8 ms
[2025-06-01 02:23:07] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 59 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444150 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 444150 steps, saw 238508 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2025-06-01 02:23:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:23:11] [INFO ] Computed 25 invariants in 7 ms
[2025-06-01 02:23:11] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 65 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:23:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:23:12] [INFO ] Invariant cache hit.
[2025-06-01 02:23:13] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-06-01 02:23:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:23:13] [INFO ] Invariant cache hit.
[2025-06-01 02:23:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:23:15] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
[2025-06-01 02:23:15] [INFO ] Redundant transitions in 49 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:23:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:23:15] [INFO ] Invariant cache hit.
[2025-06-01 02:23:15] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:23:30] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2025-06-01 02:23:30] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 124 places in 172 ms of which 3 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:23:33] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:23:33] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2025-06-01 02:23:34] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2025-06-01 02:23:34] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:23:34] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:23:36] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:23:36] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:23:36] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:23:37] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:23:37] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:23:37] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:23:38] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:23:38] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:23:38] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:23:38] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2025-06-01 02:23:40] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:23:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 02:23:40] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:23:40] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:23:41] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:23:51] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:23:51] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:23:51] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:23:54] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:23:54] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:23:58] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 3 ms to minimize.
[2025-06-01 02:23:59] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:23:59] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:23:59] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 3 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:24:01] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:24:01] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:24:01] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:24:01] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:24:05] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:24:05] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:24:12] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:24:12] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:24:12] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:24:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:24:16] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 92 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 67/67 constraints]
After SMT, in 61285ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63619 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 23 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:24:16] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:24:16] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:24:16] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:24:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:24:16] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:24:16] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:24:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:24:16] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:24:16] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:24:16] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:24:16] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 179 ms.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 452169 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452169 steps, saw 304910 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:24:19] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:24:19] [INFO ] Computed 25 invariants in 9 ms
[2025-06-01 02:24:19] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:24:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:24:20] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2025-06-01 02:24:20] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 77 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 492075 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 492075 steps, saw 258359 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :0
[2025-06-01 02:24:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:24:24] [INFO ] Computed 25 invariants in 8 ms
[2025-06-01 02:24:24] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:24:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:24:24] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:24:25] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:24:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:24:25] [INFO ] Invariant cache hit.
[2025-06-01 02:24:25] [INFO ] Implicit Places using invariants in 416 ms returned []
[2025-06-01 02:24:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:24:25] [INFO ] Invariant cache hit.
[2025-06-01 02:24:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:24:27] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2025-06-01 02:24:27] [INFO ] Redundant transitions in 44 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:24:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:24:27] [INFO ] Invariant cache hit.
[2025-06-01 02:24:27] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 2 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:24:44] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:24:44] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:24:44] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:24:46] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:24:46] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:24:50] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:24:50] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:24:50] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:24:50] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 1 ms to minimize.
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:25:03] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 3 ms to minimize.
[2025-06-01 02:25:03] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:25:04] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:25:06] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:25:06] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:25:09] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:25:09] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:25:09] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:25:11] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:25:12] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:25:12] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:25:12] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:25:18] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:25:18] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 1 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 91 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 66/66 constraints]
After SMT, in 61266ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63457 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 22 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:25:28] [INFO ] Computed 17 invariants in 0 ms
[2025-06-01 02:25:28] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-01 02:25:28] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:25:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:25:28] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:25:28] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:25:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 02:25:29] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:25:29] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:25:29] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:25:29] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 212 ms.
RANDOM walk for 40000 steps (8 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460656 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460656 steps, saw 310349 distinct states, run finished after 3003 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-01 02:25:32] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:25:32] [INFO ] Computed 25 invariants in 10 ms
[2025-06-01 02:25:32] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 63 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502515 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502515 steps, saw 263453 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2025-06-01 02:25:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:25:36] [INFO ] Computed 25 invariants in 2 ms
[2025-06-01 02:25:36] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:25:37] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:25:37] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2025-06-01 02:25:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1091ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:25:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:25:37] [INFO ] Invariant cache hit.
[2025-06-01 02:25:38] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-01 02:25:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:25:38] [INFO ] Invariant cache hit.
[2025-06-01 02:25:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:25:40] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2025-06-01 02:25:40] [INFO ] Redundant transitions in 48 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:25:40] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:25:40] [INFO ] Invariant cache hit.
[2025-06-01 02:25:40] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:25:54] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:25:54] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:25:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2025-06-01 02:25:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:26:01] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:26:01] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:26:01] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:26:02] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 4 ms to minimize.
[2025-06-01 02:26:02] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:26:02] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:26:02] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 81 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
[2025-06-01 02:26:05] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:26:16] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:26:16] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:26:17] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:26:19] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:26:19] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:26:25] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:26:25] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 3 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:26:27] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:26:27] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:26:27] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:26:27] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 3 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:26:31] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:26:32] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:26:38] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:26:39] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:26:39] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:26:40] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 91 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 66/66 constraints]
After SMT, in 61170ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63432 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 29 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:26:41] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:26:41] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 02:26:41] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:26:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:26:41] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:26:41] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:26:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:26:41] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:26:41] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:26:41] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:26:41] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
RANDOM walk for 40000 steps (8 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 451557 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451557 steps, saw 304573 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:26:44] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2025-06-01 02:26:44] [INFO ] Computed 25 invariants in 8 ms
[2025-06-01 02:26:44] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:26:44] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:26:45] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:26:45] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 86 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 499185 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 499185 steps, saw 261828 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2025-06-01 02:26:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:26:49] [INFO ] Computed 25 invariants in 6 ms
[2025-06-01 02:26:49] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:26:50] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:26:50] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 75 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:26:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:26:50] [INFO ] Invariant cache hit.
[2025-06-01 02:26:51] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-01 02:26:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:26:51] [INFO ] Invariant cache hit.
[2025-06-01 02:26:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:26:52] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2025-06-01 02:26:52] [INFO ] Redundant transitions in 46 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:26:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:26:52] [INFO ] Invariant cache hit.
[2025-06-01 02:26:52] [INFO ] State equation strengthened by 284 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r084-tall-174860080700497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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