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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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.2M 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 1748741461931

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:31:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:31:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:31:03] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-06-01 01:31:03] [INFO ] Transformed 553 places.
[2025-06-01 01:31:03] [INFO ] Transformed 1960 transitions.
[2025-06-01 01:31:03] [INFO ] Found NUPN structural information;
[2025-06-01 01:31:03] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 325 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 546 transition count 1799
Deduced a syphon composed of 154 places in 15 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 392 transition count 1799
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1757
Applied a total of 406 rules in 172 ms. Remains 350 /553 variables (removed 203) and now considering 1757/1960 (removed 203) transitions.
[2025-06-01 01:31:04] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 350 cols
[2025-06-01 01:31:04] [INFO ] Computed 22 invariants in 24 ms
[2025-06-01 01:31:04] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-06-01 01:31:04] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:31:04] [INFO ] Invariant cache hit.
[2025-06-01 01:31:05] [INFO ] State equation strengthened by 472 read => feed constraints.
[2025-06-01 01:31:06] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2025-06-01 01:31:06] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:31:06] [INFO ] Invariant cache hit.
[2025-06-01 01:31:06] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:31:19] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 36 ms to minimize.
[2025-06-01 01:31:19] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2025-06-01 01:31:20] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:31:20] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:31:20] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:31:20] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 8 ms to minimize.
[2025-06-01 01:31:20] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 5 ms to minimize.
[2025-06-01 01:31:24] [INFO ] Deduced a trap composed of 119 places in 218 ms of which 7 ms to minimize.
[2025-06-01 01:31:24] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 3 ms to minimize.
[2025-06-01 01:31:24] [INFO ] Deduced a trap composed of 92 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:31:24] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:31:24] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:31:25] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:31:25] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:31:25] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:31:25] [INFO ] Deduced a trap composed of 107 places in 209 ms of which 3 ms to minimize.
[2025-06-01 01:31:26] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:31:26] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:31:26] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:31:26] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 392 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30042 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:31:43] [INFO ] Deduced a trap composed of 94 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:31:43] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:31:43] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:31:44] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:31:44] [INFO ] Deduced a trap composed of 91 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:31:44] [INFO ] Deduced a trap composed of 96 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:31:44] [INFO ] Deduced a trap composed of 63 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:31:45] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:31:45] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:31:45] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 3 ms to minimize.
[2025-06-01 01:31:45] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:31:46] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:31:46] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:31:46] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:31:46] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 6 ms to minimize.
[2025-06-01 01:31:46] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:31:52] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:31:52] [INFO ] Deduced a trap composed of 91 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:31:52] [INFO ] Deduced a trap composed of 81 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 88 places in 214 ms of which 2 ms to minimize.
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 2 ms to minimize.
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:31:54] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:31:54] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:31:54] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:31:54] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:31:54] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 94 places in 220 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 3 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1148 variables, and 452 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30027 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 0/1750 constraints, Known Traps: 80/80 constraints]
After SMT, in 61214ms problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 61263ms
Starting structural reductions in LIVENESS mode, iteration 1 : 350/553 places, 1757/1960 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 64135 ms. Remains : 350/553 places, 1757/1960 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 7315 ms. (5 steps per ms) remains 1394/1750 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1394/1394 properties
[2025-06-01 01:32:10] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:32:10] [INFO ] Invariant cache hit.
[2025-06-01 01:32:10] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 1394 unsolved
SMT process timed out in 5819ms, After SMT, problems are : Problem set: 0 solved, 1394 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 261 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Applied a total of 0 rules in 104 ms. Remains 350 /350 variables (removed 0) and now considering 1757/1757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 350/350 places, 1757/1757 transitions.
RANDOM walk for 1612864 steps (4 resets) in 120004 ms. (13 steps per ms) remains 1367/1394 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1367/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1366/1367 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1363/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1359/1363 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1355/1359 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1355/1355 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1355/1355 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1353/1355 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1351/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1349/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1347/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1346/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 1345/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1344/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1343/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1342/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1341/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1337/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1336/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1335/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1334/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1333/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1330/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1328/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1323/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1322/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1321/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1320/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1319/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1316/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1315/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1314/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1313/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1313/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1312/1313 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1312/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1311/1312 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1311/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1310/1310 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1310/1310 properties
Probabilistic random walk after 1000000 steps, saw 578750 distinct states, run finished after 46994 ms. (steps per millisecond=21 ) properties seen :334
[2025-06-01 01:33:37] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:33:37] [INFO ] Invariant cache hit.
[2025-06-01 01:33:37] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 3 (OVERLAPS) 180/350 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 3 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 73 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 94 places in 219 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:33:55] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:33:55] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 81 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 89 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:34:04] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:34:04] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:04] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:34:04] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 105 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 90 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 89 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 2 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 3 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 105 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 90 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 98 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 96 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 89 places in 220 ms of which 3 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 126 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 103 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 98 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 104 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 976 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 452 constraints, problems are : Problem set: 0 solved, 976 unsolved in 45021 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 976/976 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 976 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 3 (OVERLAPS) 180/350 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 80/452 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 135 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:34] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:34:34] [INFO ] Deduced a trap composed of 94 places in 213 ms of which 3 ms to minimize.
[2025-06-01 01:34:35] [INFO ] Deduced a trap composed of 97 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:34:35] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:34:35] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:34:35] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:34:35] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 85 places in 199 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:34:41] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:34:41] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:34:41] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:34:41] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 94 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 95 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:34:45] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 103 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 1 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:34:53] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:34:53] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:34:53] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:34:54] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:34:54] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:34:54] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:34:54] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:34:54] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:34:55] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:34:55] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:34:55] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:34:55] [INFO ] Deduced a trap composed of 85 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 101 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 100 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 91 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 2 ms to minimize.
SMT process timed out in 90747ms, After SMT, problems are : Problem set: 0 solved, 976 unsolved
Fused 976 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 170 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 342 transition count 1701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 342 transition count 1701
Applied a total of 16 rules in 71 ms. Remains 342 /350 variables (removed 8) and now considering 1701/1757 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 342/350 places, 1701/1757 transitions.
RANDOM walk for 1871073 steps (4 resets) in 120009 ms. (15 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 976/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/976 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 973/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 973/973 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 44452 ms. (steps per millisecond=22 ) properties seen :22
[2025-06-01 01:36:24] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:36:24] [INFO ] Computed 22 invariants in 5 ms
[2025-06-01 01:36:25] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:36:38] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:36:39] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:36:39] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:36:39] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:36:39] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:36:39] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:36:40] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:36:40] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:36:40] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:36:40] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:36:40] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:36:43] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:36:43] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:36:43] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 99 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 95 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 96 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 84 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:06] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 128 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:37:08] [INFO ] Deduced a trap composed of 103 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:37:08] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:37:08] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:37:08] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:08] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 6 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 80 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 92 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:37:25] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:37:25] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:37:25] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:25] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:37:25] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:26] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:37:26] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:37:26] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:37:26] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 86 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:37:33] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 4 ms to minimize.
[2025-06-01 01:37:33] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:37:33] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 202 constraints, problems are : Problem set: 0 solved, 951 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:47] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:37:47] [INFO ] Deduced a trap composed of 83 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:37:47] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:37:47] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:37:47] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:37:48] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:37:48] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:37:48] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 90 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:37:54] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:54] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:37:54] [INFO ] Deduced a trap composed of 99 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:37:54] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:37:55] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:37:55] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:37:55] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:37:55] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:00] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:38:00] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:38:01] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:38:01] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 1 ms to minimize.
[2025-06-01 01:38:01] [INFO ] Deduced a trap composed of 83 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:01] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:38:01] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:02] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:38:02] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 6 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:11] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:38:11] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:38:11] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:38:11] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:38:11] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:12] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:38:12] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 1 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:17] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:38:17] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:38:17] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:17] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:38:18] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:38:18] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:38:18] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:38:19] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:38:19] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:38:19] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 84 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 92 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 88 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 95 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 3 ms to minimize.
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 92 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:38:40] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 93 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 81 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 103 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:46] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:38:46] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:46] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:46] [INFO ] Deduced a trap composed of 116 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:38:46] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:38:47] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:38:47] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:38:47] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 1 ms to minimize.
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 131 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 95 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 91 places in 201 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:38:51] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:52] [INFO ] Deduced a trap composed of 96 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 365 constraints, problems are : Problem set: 0 solved, 951 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/951 constraints, Known Traps: 343/343 constraints]
After SMT, in 150612ms problems are : Problem set: 0 solved, 951 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 70 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 2461176 steps (4 resets) in 120004 ms. (20 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 43872 ms. (steps per millisecond=22 ) properties seen :0
[2025-06-01 01:40:09] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:40:09] [INFO ] Invariant cache hit.
[2025-06-01 01:40:09] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:23] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 80 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 103 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 92 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 83 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 86 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 3 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:49] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 83 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:40:51] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:40:51] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:40:51] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 3 ms to minimize.
[2025-06-01 01:40:51] [INFO ] Deduced a trap composed of 89 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 124 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:40:58] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:40:58] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:40:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:40:58] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:40:58] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:41:07] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:41:08] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:08] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:08] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:41:09] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:41:09] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:09] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:41:11] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:41:11] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:41:11] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:41:11] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:11] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:41:12] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:41:12] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:41:18] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 13 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 83 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 94 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 91 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 222 constraints, problems are : Problem set: 0 solved, 951 unsolved in 90020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 200/200 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:41:48] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:48] [INFO ] Deduced a trap composed of 94 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:41:49] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 1 ms to minimize.
[2025-06-01 01:41:49] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:41:49] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:41:49] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:41:49] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 116 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:41:51] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:51] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:41:52] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:41:56] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:41:56] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:01] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:42:02] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:42:04] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:42:04] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:42:04] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:42:06] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 84 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 96 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:42:09] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:42:09] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:42:09] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 1 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:42:13] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:42:14] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:14] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:42:14] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 5 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:42:20] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:42:20] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:42:20] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:22] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:42:22] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:22] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:24] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:27] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:42:28] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:42:29] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:42:30] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:42:30] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 2 ms to minimize.
[2025-06-01 01:42:30] [INFO ] Deduced a trap composed of 104 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:42:30] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:42:31] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:42:31] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:42:31] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:42:32] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:42:32] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:42:33] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:33] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:42:33] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:42:35] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:42:35] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:42:35] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:42:35] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:42:36] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:38] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:42:38] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:42:38] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:42:38] [INFO ] Deduced a trap composed of 108 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:42:39] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:42:39] [INFO ] Deduced a trap composed of 95 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:42:39] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:42:40] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 1 ms to minimize.
[2025-06-01 01:42:40] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:42:42] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:42] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:42:42] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:42:42] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 124 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:42:49] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:42:49] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:42:49] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:42:49] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:42:50] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:42:50] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:42:50] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:42:51] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:42:52] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:42:52] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:42:53] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:42:53] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 1 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:42:58] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:42:58] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:42:58] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:43:09] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 1 ms to minimize.
[2025-06-01 01:43:10] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
SMT process timed out in 180666ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Fused 951 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 45 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 39 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-01 01:43:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:43:10] [INFO ] Invariant cache hit.
[2025-06-01 01:43:10] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-01 01:43:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:43:10] [INFO ] Invariant cache hit.
[2025-06-01 01:43:11] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:43:11] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2025-06-01 01:43:11] [INFO ] Redundant transitions in 80 ms returned []
Running 1694 sub problems to find dead transitions.
[2025-06-01 01:43:11] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:43:11] [INFO ] Invariant cache hit.
[2025-06-01 01:43:11] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 1 ms to minimize.
[2025-06-01 01:43:25] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:43:25] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 3 ms to minimize.
[2025-06-01 01:43:25] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:43:26] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:43:26] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:43:26] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:26] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:43:26] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:43:27] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:43:27] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:27] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.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 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 62 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 1694/1694 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 1 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 96 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 93 places in 210 ms of which 3 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:43:57] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 100 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 1 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 88 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/1694 constraints, Known Traps: 120/120 constraints]
After SMT, in 60821ms problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 60835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61839 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 5956 ms. (67 steps per ms) remains 71/161 properties
Running SMT prover for 71 properties.
[2025-06-01 01:44:14] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:44:14] [INFO ] Invariant cache hit.
[2025-06-01 01:44:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:44:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:44:14] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :71
[2025-06-01 01:44:14] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:44:14] [INFO ] After 291ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:44:18] [INFO ] After 3428ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:44:18] [INFO ] After 3790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:44:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-01 01:44:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:44:18] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2025-06-01 01:44:18] [INFO ] After 380ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 939 ms
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 591 ms
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
TRAPS : Iteration 1
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 2
[2025-06-01 01:44:32] [INFO ] After 13723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
[2025-06-01 01:44:32] [INFO ] After 14550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
RANDOM walk for 1271538 steps (1 resets) in 120004 ms. (10 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 951/951 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 45716 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-01 01:45:49] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:45:49] [INFO ] Invariant cache hit.
[2025-06-01 01:45:49] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:03] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 3 ms to minimize.
[2025-06-01 01:46:03] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2025-06-01 01:46:03] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:46:03] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:03] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:04] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:46:04] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:46:04] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:46:04] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:46:04] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:46:05] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 2 ms to minimize.
[2025-06-01 01:46:05] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:46:05] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:46:06] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:46:06] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:06] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:06] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:46:08] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:46:08] [INFO ] Deduced a trap composed of 103 places in 220 ms of which 2 ms to minimize.
[2025-06-01 01:46:08] [INFO ] Deduced a trap composed of 92 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:46:12] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:12] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2025-06-01 01:46:13] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:13] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 86 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:46:15] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:46:15] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 3 ms to minimize.
[2025-06-01 01:46:15] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:15] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:46:15] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:46:16] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:16] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:16] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:46:16] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:46:17] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:46:17] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:46:17] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 93 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 3 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 3 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 3 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 72 places in 217 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 68 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 83 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 87 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 102 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 85 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:37] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:46:37] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 2 ms to minimize.
[2025-06-01 01:46:37] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 1 ms to minimize.
[2025-06-01 01:46:37] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 91 places in 220 ms of which 3 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:40] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:46:40] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:46:40] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 1 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 58 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 83 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 94 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 91 places in 220 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 94 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:47:22] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 1 ms to minimize.
[2025-06-01 01:47:23] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 1 ms to minimize.
[2025-06-01 01:47:23] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:23] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 105 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 94 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 101 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 1 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
SMT process timed out in 105659ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Fused 951 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 43 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 42 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-01 01:47:34] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:47:34] [INFO ] Invariant cache hit.
[2025-06-01 01:47:35] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-01 01:47:35] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:47:35] [INFO ] Invariant cache hit.
[2025-06-01 01:47:35] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:47:35] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2025-06-01 01:47:35] [INFO ] Redundant transitions in 93 ms returned []
Running 1694 sub problems to find dead transitions.
[2025-06-01 01:47:35] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:47:35] [INFO ] Invariant cache hit.
[2025-06-01 01:47:36] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:47:50] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:47:50] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:47:52] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:47:52] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:47:52] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:47:52] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:47:55] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:47:56] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:47:56] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:56] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:47:56] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 62 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 1694/1694 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 2 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:48:14] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:14] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:48:14] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:14] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:48:17] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 103 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 1 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 4 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:48:21] [INFO ] Deduced a trap composed of 91 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:48:21] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:48:21] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:48:21] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:48:21] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:48:32] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:48:32] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 88 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 1 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:48:36] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:48:36] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:48:36] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/1694 constraints, Known Traps: 120/120 constraints]
After SMT, in 60857ms problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 60874ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61919 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 8630 ms. (46 steps per ms) remains 71/161 properties
Running SMT prover for 71 properties.
[2025-06-01 01:48:39] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:48:39] [INFO ] Invariant cache hit.
[2025-06-01 01:48:39] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:48:39] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:48:40] [INFO ] After 254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :71
[2025-06-01 01:48:40] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:48:40] [INFO ] After 279ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:48:43] [INFO ] After 3285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:48:43] [INFO ] After 3650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:48:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:48:43] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:48:43] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2025-06-01 01:48:44] [INFO ] After 362ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 1 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1113 ms
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:48:45] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2025-06-01 01:48:50] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 1
[2025-06-01 01:48:50] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2025-06-01 01:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 2
[2025-06-01 01:48:57] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 3
[2025-06-01 01:49:00] [INFO ] After 17048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
[2025-06-01 01:49:01] [INFO ] After 17856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
RANDOM walk for 407 steps (0 resets) in 8 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 849 steps (0 resets) in 11 ms. (70 steps per ms) remains 0/1 properties
RANDOM walk for 1199 steps (0 resets) in 13 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 844 steps (0 resets) in 9 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 1696 steps (0 resets) in 13 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 1497 steps (0 resets) in 13 ms. (106 steps per ms) remains 0/1 properties
RANDOM walk for 2249 steps (0 resets) in 18 ms. (118 steps per ms) remains 0/1 properties
RANDOM walk for 1589 steps (0 resets) in 11 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 2622 steps (0 resets) in 20 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 2130 steps (0 resets) in 16 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 182 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 2578 steps (0 resets) in 20 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 1149 steps (0 resets) in 13 ms. (82 steps per ms) remains 0/1 properties
RANDOM walk for 1834 steps (0 resets) in 13 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 2264 steps (0 resets) in 14 ms. (150 steps per ms) remains 0/1 properties
RANDOM walk for 2189 steps (0 resets) in 17 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 106 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
RANDOM walk for 501 steps (0 resets) in 6 ms. (71 steps per ms) remains 0/1 properties
RANDOM walk for 1818 steps (0 resets) in 14 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 1868 steps (0 resets) in 15 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 2511 steps (0 resets) in 17 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 55 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 465 steps (0 resets) in 6 ms. (66 steps per ms) remains 0/1 properties
RANDOM walk for 1003 steps (0 resets) in 10 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 2182 steps (0 resets) in 30 ms. (70 steps per ms) remains 0/1 properties
RANDOM walk for 2509 steps (0 resets) in 19 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 481 steps (0 resets) in 7 ms. (60 steps per ms) remains 0/1 properties
RANDOM walk for 836 steps (0 resets) in 7 ms. (104 steps per ms) remains 0/1 properties
RANDOM walk for 1389 steps (0 resets) in 12 ms. (106 steps per ms) remains 0/1 properties
RANDOM walk for 2494 steps (0 resets) in 21 ms. (113 steps per ms) remains 0/1 properties
RANDOM walk for 98 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 419 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 1113 steps (0 resets) in 10 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 1402 steps (0 resets) in 14 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 1726 steps (0 resets) in 15 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 1091 steps (0 resets) in 9 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 1271 steps (0 resets) in 12 ms. (97 steps per ms) remains 0/1 properties
RANDOM walk for 1745 steps (0 resets) in 14 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 2284 steps (0 resets) in 18 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 30031 steps (6 resets) in 191 ms. (156 steps per ms) remains 0/1 properties
RANDOM walk for 419 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 955 steps (0 resets) in 9 ms. (95 steps per ms) remains 0/1 properties
RANDOM walk for 39 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 1365 steps (0 resets) in 10 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 1568 steps (0 resets) in 12 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 2204 steps (0 resets) in 18 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 55 steps (0 resets) in 4 ms. (11 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 2745 steps (0 resets) in 24 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 27 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567016 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 567016 steps, saw 327261 distinct states, run finished after 3004 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-01 01:49:04] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:04] [INFO ] Invariant cache hit.
[2025-06-01 01:49:04] [INFO ] State equation strengthened by 424 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 01:49:05] [INFO ] Deduced a trap composed of 3 places in 48 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:05] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:49:05] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:49:05] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1139ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 14 ms.
RANDOM walk for 40000 steps (8 resets) in 620 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 564128 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 564128 steps, saw 325537 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-01 01:49:09] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:09] [INFO ] Invariant cache hit.
[2025-06-01 01:49:09] [INFO ] State equation strengthened by 424 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 01:49:09] [INFO ] Deduced a trap composed of 3 places in 47 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12245 steps, including 394 resets, run visited all 1 properties in 72 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 71 ms.
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 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 569752 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569752 steps, saw 328409 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-06-01 01:49:14] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:14] [INFO ] Invariant cache hit.
[2025-06-01 01:49:14] [INFO ] State equation strengthened by 424 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 01:49:14] [INFO ] Deduced a trap composed of 3 places in 38 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:14] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:49:15] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:49:15] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:49:15] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:49:15] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 70 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 219398 steps, run visited all 1 properties in 1038 ms. (steps per millisecond=211 )
Probabilistic random walk after 219398 steps, saw 108562 distinct states, run finished after 1042 ms. (steps per millisecond=210 ) properties seen :1
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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 96174 steps, run visited all 1 properties in 497 ms. (steps per millisecond=193 )
Probabilistic random walk after 96174 steps, saw 65378 distinct states, run finished after 497 ms. (steps per millisecond=193 ) 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 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558576 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558576 steps, saw 322323 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-01 01:49:20] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:20] [INFO ] Invariant cache hit.
[2025-06-01 01:49:20] [INFO ] State equation strengthened by 424 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 01:49:20] [INFO ] Deduced a trap composed of 3 places in 41 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 72 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 308/342 places, 1463/1701 transitions.
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 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26934 steps, run visited all 1 properties in 133 ms. (steps per millisecond=202 )
Probabilistic random walk after 26934 steps, saw 18143 distinct states, run finished after 133 ms. (steps per millisecond=202 ) properties seen :1
RANDOM walk for 9165 steps (1 resets) in 50 ms. (179 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 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 566752 steps, run timeout after 3019 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 566752 steps, saw 327094 distinct states, run finished after 3019 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-01 01:49:25] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:25] [INFO ] Invariant cache hit.
[2025-06-01 01:49:25] [INFO ] State equation strengthened by 424 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 01:49:25] [INFO ] Deduced a trap composed of 3 places in 36 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 5 ms.
RANDOM walk for 438 steps (0 resets) in 7 ms. (54 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 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 574696 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 574696 steps, saw 331202 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
[2025-06-01 01:49:30] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:30] [INFO ] Invariant cache hit.
[2025-06-01 01:49:30] [INFO ] State equation strengthened by 424 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 01:49:30] [INFO ] Deduced a trap composed of 3 places in 38 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:30] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1541ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7098 steps, including 249 resets, run visited all 1 properties in 41 ms. (steps per millisecond=173 )
Parikh walk visited 1 properties in 41 ms.
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 113 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 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 128790 steps, run visited all 1 properties in 686 ms. (steps per millisecond=187 )
Probabilistic random walk after 128790 steps, saw 85754 distinct states, run finished after 687 ms. (steps per millisecond=187 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 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 172198 steps, run visited all 1 properties in 888 ms. (steps per millisecond=193 )
Probabilistic random walk after 172198 steps, saw 111859 distinct states, run finished after 891 ms. (steps per millisecond=193 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 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 90342 steps, run visited all 1 properties in 474 ms. (steps per millisecond=190 )
Probabilistic random walk after 90342 steps, saw 61693 distinct states, run finished after 474 ms. (steps per millisecond=190 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 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 133406 steps, run visited all 1 properties in 702 ms. (steps per millisecond=190 )
Probabilistic random walk after 133406 steps, saw 88796 distinct states, run finished after 703 ms. (steps per millisecond=189 ) properties seen :1
RANDOM walk for 32971 steps (6 resets) in 137 ms. (238 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 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 229926 steps, run visited all 1 properties in 1213 ms. (steps per millisecond=189 )
Probabilistic random walk after 229926 steps, saw 146021 distinct states, run finished after 1213 ms. (steps per millisecond=189 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562528 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562528 steps, saw 324527 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-01 01:49:39] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:39] [INFO ] Invariant cache hit.
[2025-06-01 01:49:39] [INFO ] State equation strengthened by 424 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 01:49:39] [INFO ] Deduced a trap composed of 3 places in 39 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:39] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:49:40] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 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 47790 steps, run visited all 1 properties in 251 ms. (steps per millisecond=190 )
Probabilistic random walk after 47790 steps, saw 34076 distinct states, run finished after 251 ms. (steps per millisecond=190 ) properties seen :1
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 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 573872 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 573872 steps, saw 330841 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
[2025-06-01 01:49:44] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:44] [INFO ] Invariant cache hit.
[2025-06-01 01:49:44] [INFO ] State equation strengthened by 424 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 01:49:44] [INFO ] Deduced a trap composed of 3 places in 42 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:44] [INFO ] Deduced a trap composed of 90 places in 184 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:45] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2025-06-01 01:49:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1196ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 43 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 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 600326 steps, run visited all 1 properties in 2829 ms. (steps per millisecond=212 )
Probabilistic random walk after 600326 steps, saw 223795 distinct states, run finished after 2830 ms. (steps per millisecond=212 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 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 364350 steps, run visited all 1 properties in 1908 ms. (steps per millisecond=190 )
Probabilistic random walk after 364350 steps, saw 222216 distinct states, run finished after 1909 ms. (steps per millisecond=190 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 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 113158 steps, run visited all 1 properties in 612 ms. (steps per millisecond=184 )
Probabilistic random walk after 113158 steps, saw 76084 distinct states, run finished after 612 ms. (steps per millisecond=184 ) properties seen :1
RANDOM walk for 28661 steps (6 resets) in 131 ms. (217 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 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 22478 steps, run visited all 1 properties in 120 ms. (steps per millisecond=187 )
Probabilistic random walk after 22478 steps, saw 16711 distinct states, run finished after 120 ms. (steps per millisecond=187 ) properties seen :1
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 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9766 steps, run visited all 1 properties in 52 ms. (steps per millisecond=187 )
Probabilistic random walk after 9766 steps, saw 7506 distinct states, run finished after 53 ms. (steps per millisecond=184 ) 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 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69470 steps, run visited all 1 properties in 368 ms. (steps per millisecond=188 )
Probabilistic random walk after 69470 steps, saw 48247 distinct states, run finished after 369 ms. (steps per millisecond=188 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 156830 steps, run visited all 1 properties in 836 ms. (steps per millisecond=187 )
Probabilistic random walk after 156830 steps, saw 102967 distinct states, run finished after 836 ms. (steps per millisecond=187 ) properties seen :1
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 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137334 steps, run visited all 1 properties in 726 ms. (steps per millisecond=189 )
Probabilistic random walk after 137334 steps, saw 91235 distinct states, run finished after 727 ms. (steps per millisecond=188 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 65622 steps, run visited all 1 properties in 340 ms. (steps per millisecond=193 )
Probabilistic random walk after 65622 steps, saw 45757 distinct states, run finished after 341 ms. (steps per millisecond=192 ) properties seen :1
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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2966 steps, run visited all 1 properties in 21 ms. (steps per millisecond=141 )
Probabilistic random walk after 2966 steps, saw 2436 distinct states, run finished after 22 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 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 2246 steps, run visited all 1 properties in 15 ms. (steps per millisecond=149 )
Probabilistic random walk after 2246 steps, saw 1845 distinct states, run finished after 15 ms. (steps per millisecond=149 ) properties seen :1
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 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 568904 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 568904 steps, saw 327995 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-06-01 01:49:57] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:57] [INFO ] Invariant cache hit.
[2025-06-01 01:49:57] [INFO ] State equation strengthened by 424 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 01:49:57] [INFO ] Deduced a trap composed of 3 places in 33 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1068ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 40 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 308/342 places, 1463/1701 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 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 643872 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 643872 steps, saw 235902 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2025-06-01 01:50:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 01:50:01] [INFO ] Computed 22 invariants in 8 ms
[2025-06-01 01:50:01] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 39 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 01:50:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:50:02] [INFO ] Invariant cache hit.
[2025-06-01 01:50:03] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-01 01:50:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:50:03] [INFO ] Invariant cache hit.
[2025-06-01 01:50:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 01:50:04] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2025-06-01 01:50:04] [INFO ] Redundant transitions in 31 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 01:50:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:50:04] [INFO ] Invariant cache hit.
[2025-06-01 01:50:04] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:50:12] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:50:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:50:27] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:50:27] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:50:27] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:50:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:50:27] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:50:59] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:50:59] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:51:04] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:51:04] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:51:04] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:51:04] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:51:05] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 60778ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62265 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
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 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 66 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2025-06-01 01:51:05] [INFO ] Computed 15 invariants in 0 ms
[2025-06-01 01:51:05] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:51:05] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:51:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 01:51:05] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:51:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:51:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:51:05] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:51:05] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:51:05] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:51:05] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 184 ms.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 570064 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 570064 steps, saw 328604 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-06-01 01:51:08] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:51:08] [INFO ] Computed 22 invariants in 5 ms
[2025-06-01 01:51:08] [INFO ] State equation strengthened by 424 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 01:51:08] [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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1179ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 60 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 308/342 places, 1463/1701 transitions.
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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 51886 steps, run visited all 1 properties in 258 ms. (steps per millisecond=201 )
Probabilistic random walk after 51886 steps, saw 32735 distinct states, run finished after 258 ms. (steps per millisecond=201 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 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 102246 steps, run visited all 1 properties in 541 ms. (steps per millisecond=188 )
Probabilistic random walk after 102246 steps, saw 69177 distinct states, run finished after 541 ms. (steps per millisecond=188 ) 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 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 151782 steps, run visited all 1 properties in 859 ms. (steps per millisecond=176 )
Probabilistic random walk after 151782 steps, saw 99847 distinct states, run finished after 860 ms. (steps per millisecond=176 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 69038 steps, run visited all 1 properties in 382 ms. (steps per millisecond=180 )
Probabilistic random walk after 69038 steps, saw 48014 distinct states, run finished after 384 ms. (steps per millisecond=179 ) properties seen :1
RANDOM walk for 30512 steps (6 resets) in 129 ms. (234 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 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 758 steps, run visited all 1 properties in 8 ms. (steps per millisecond=94 )
Probabilistic random walk after 758 steps, saw 651 distinct states, run finished after 8 ms. (steps per millisecond=94 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 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 72278 steps, run visited all 1 properties in 405 ms. (steps per millisecond=178 )
Probabilistic random walk after 72278 steps, saw 50032 distinct states, run finished after 405 ms. (steps per millisecond=178 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 49510 steps, run visited all 1 properties in 276 ms. (steps per millisecond=179 )
Probabilistic random walk after 49510 steps, saw 35268 distinct states, run finished after 278 ms. (steps per millisecond=178 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 23638 steps, run visited all 1 properties in 132 ms. (steps per millisecond=179 )
Probabilistic random walk after 23638 steps, saw 17572 distinct states, run finished after 132 ms. (steps per millisecond=179 ) properties seen :1
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 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9014 steps, run visited all 1 properties in 53 ms. (steps per millisecond=170 )
Probabilistic random walk after 9014 steps, saw 6971 distinct states, run finished after 53 ms. (steps per millisecond=170 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 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 10662 steps, run visited all 1 properties in 63 ms. (steps per millisecond=169 )
Probabilistic random walk after 10662 steps, saw 8235 distinct states, run finished after 64 ms. (steps per millisecond=166 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 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 3854 steps, run visited all 1 properties in 25 ms. (steps per millisecond=154 )
Probabilistic random walk after 3854 steps, saw 3124 distinct states, run finished after 25 ms. (steps per millisecond=154 ) properties seen :1
RANDOM walk for 271 steps (0 resets) in 8 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 660 steps (0 resets) in 8 ms. (73 steps per ms) remains 0/1 properties
RANDOM walk for 1142 steps (0 resets) in 10 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 1740 steps (0 resets) in 12 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 1878 steps (0 resets) in 13 ms. (134 steps per ms) remains 0/1 properties
RANDOM walk for 2593 steps (0 resets) in 16 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 287 steps (0 resets) in 4 ms. (57 steps per ms) remains 0/1 properties
RANDOM walk for 782 steps (0 resets) in 8 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 1220 steps (0 resets) in 11 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 1767 steps (0 resets) in 11 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 2137 steps (0 resets) in 13 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 2655 steps (0 resets) in 16 ms. (156 steps per ms) remains 0/1 properties
RANDOM walk for 2902 steps (0 resets) in 18 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 541168 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 541168 steps, saw 313405 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-06-01 01:51:16] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:51:16] [INFO ] Invariant cache hit.
[2025-06-01 01:51:16] [INFO ] State equation strengthened by 424 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 01:51:16] [INFO ] Deduced a trap composed of 3 places in 39 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:51:17] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:51:17] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 46 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 210 ms. (189 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
Interrupted probabilistic random walk after 615056 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 615056 steps, saw 228186 distinct states, run finished after 3002 ms. (steps per millisecond=204 ) properties seen :0
[2025-06-01 01:51:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 01:51:20] [INFO ] Computed 22 invariants in 6 ms
[2025-06-01 01:51:20] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:51:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 31 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 31 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 01:51:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:51:21] [INFO ] Invariant cache hit.
[2025-06-01 01:51:22] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-06-01 01:51:22] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:51:22] [INFO ] Invariant cache hit.
[2025-06-01 01:51:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 01:51:23] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2025-06-01 01:51:23] [INFO ] Redundant transitions in 25 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 01:51:23] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:51:23] [INFO ] Invariant cache hit.
[2025-06-01 01:51:23] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:51:31] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:51:31] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:51:32] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:51:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:51:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:51:32] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:51:32] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:51:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2025-06-01 01:51:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:51:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:51:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:51:38] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:51:38] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:51:40] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:51:41] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:51:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:51:46] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:51:46] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:51:46] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:51:47] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:51:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:51:47] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:51:47] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:51:47] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:51:55] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:51:56] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:51:56] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:51:56] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:51:56] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:51:57] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:51:57] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:51:57] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:51:57] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:51:57] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:51:58] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:51:58] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:51:58] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:51:58] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:51:58] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:51:59] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:51:59] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:51:59] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:52:00] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:52:00] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:52:10] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:52:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:52:10] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:52:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:52:11] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:52:11] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:52:12] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:52:12] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:52:12] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:52:12] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:52:12] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:52:13] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:14] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:14] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 1 ms to minimize.
[2025-06-01 01:52:14] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:52:18] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:52:19] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:52:19] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:52:19] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:52:19] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:52:19] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:52:20] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:52:20] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:52:20] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:52:20] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:52:21] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:52:21] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:52:22] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:52:22] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:52:22] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:52:23] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:52:23] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:52:23] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:52:23] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 121 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 99/99 constraints]
After SMT, in 60649ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62159 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 21 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2025-06-01 01:52:23] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 01:52:23] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:52:23] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:52:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 01:52:24] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:52:24] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:52:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:52:24] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:52:24] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:52:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:52:24] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 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 573144 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 573144 steps, saw 330415 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2025-06-01 01:52:27] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:52:27] [INFO ] Computed 22 invariants in 8 ms
[2025-06-01 01:52:27] [INFO ] State equation strengthened by 424 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 01:52:27] [INFO ] Deduced a trap composed of 3 places in 45 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:52:27] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:52:28] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:52:28] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1369ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 38 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 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 644144 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 644144 steps, saw 236057 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2025-06-01 01:52:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 01:52:31] [INFO ] Computed 22 invariants in 2 ms
[2025-06-01 01:52:31] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:52:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:52:32] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 716ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 38 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 01:52:32] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:52:32] [INFO ] Invariant cache hit.
[2025-06-01 01:52:32] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-06-01 01:52:32] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:52:32] [INFO ] Invariant cache hit.
[2025-06-01 01:52:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 01:52:33] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2025-06-01 01:52:33] [INFO ] Redundant transitions in 100 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 01:52:34] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:52:34] [INFO ] Invariant cache hit.
[2025-06-01 01:52:34] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:52:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:52:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:52:49] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:52:49] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 67 places in 175 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/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:53:06] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:53:09] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:53:09] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:53:09] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:53:09] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:53:10] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:53:10] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:53:10] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:53:11] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:53:11] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:53:21] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:53:21] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:53:21] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:53:21] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:53:33] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:53:33] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:53:33] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:53:34] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:53:34] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2025-06-01 01:53:34] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
SMT process timed out in 60711ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62233 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 17 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2025-06-01 01:53:34] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 01:53:34] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:53:34] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:53:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 01:53:34] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:53:34] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:53:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 01:53:34] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:53:34] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:53:34] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:53:34] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 159 ms.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 561120 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 561120 steps, saw 323765 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-01 01:53:37] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:53:37] [INFO ] Computed 22 invariants in 8 ms
[2025-06-01 01:53:37] [INFO ] State equation strengthened by 424 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 01:53:38] [INFO ] Deduced a trap composed of 3 places in 40 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:53:38] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:53:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:53:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1230ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 36 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/342 places, 1463/1701 transitions.
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 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 520590 steps, run visited all 1 properties in 2415 ms. (steps per millisecond=215 )
Probabilistic random walk after 520590 steps, saw 200480 distinct states, run finished after 2415 ms. (steps per millisecond=215 ) properties seen :1
RANDOM walk for 2162 steps (0 resets) in 25 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 230 steps (0 resets) in 4 ms. (46 steps per ms) remains 0/1 properties
RANDOM walk for 675 steps (0 resets) in 8 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 1042 steps (0 resets) in 9 ms. (104 steps per ms) remains 0/1 properties
RANDOM walk for 1491 steps (0 resets) in 12 ms. (114 steps per ms) remains 0/1 properties
RANDOM walk for 1848 steps (0 resets) in 17 ms. (102 steps per ms) remains 0/1 properties
RANDOM walk for 2402 steps (0 resets) in 21 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 2805 steps (0 resets) in 18 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 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 10110 steps, run visited all 1 properties in 53 ms. (steps per millisecond=190 )
Probabilistic random walk after 10110 steps, saw 7778 distinct states, run finished after 54 ms. (steps per millisecond=187 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 10118 steps, run visited all 1 properties in 57 ms. (steps per millisecond=177 )
Probabilistic random walk after 10118 steps, saw 7785 distinct states, run finished after 58 ms. (steps per millisecond=174 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 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 10126 steps, run visited all 1 properties in 58 ms. (steps per millisecond=174 )
Probabilistic random walk after 10126 steps, saw 7792 distinct states, run finished after 58 ms. (steps per millisecond=174 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 10134 steps, run visited all 1 properties in 60 ms. (steps per millisecond=168 )
Probabilistic random walk after 10134 steps, saw 7799 distinct states, run finished after 60 ms. (steps per millisecond=168 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 10142 steps, run visited all 1 properties in 58 ms. (steps per millisecond=174 )
Probabilistic random walk after 10142 steps, saw 7806 distinct states, run finished after 58 ms. (steps per millisecond=174 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 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 46862 steps, run visited all 1 properties in 263 ms. (steps per millisecond=178 )
Probabilistic random walk after 46862 steps, saw 33349 distinct states, run finished after 263 ms. (steps per millisecond=178 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 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 13662 steps, run visited all 1 properties in 75 ms. (steps per millisecond=182 )
Probabilistic random walk after 13662 steps, saw 10321 distinct states, run finished after 76 ms. (steps per millisecond=179 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 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 46838 steps, run visited all 1 properties in 264 ms. (steps per millisecond=177 )
Probabilistic random walk after 46838 steps, saw 33328 distinct states, run finished after 266 ms. (steps per millisecond=176 ) properties seen :1
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 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46846 steps, run visited all 1 properties in 245 ms. (steps per millisecond=191 )
Probabilistic random walk after 46846 steps, saw 33335 distinct states, run finished after 245 ms. (steps per millisecond=191 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 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 46854 steps, run visited all 1 properties in 263 ms. (steps per millisecond=178 )
Probabilistic random walk after 46854 steps, saw 33342 distinct states, run finished after 263 ms. (steps per millisecond=178 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16942 steps, run visited all 1 properties in 94 ms. (steps per millisecond=180 )
Probabilistic random walk after 16942 steps, saw 12667 distinct states, run finished after 94 ms. (steps per millisecond=180 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 16950 steps, run visited all 1 properties in 99 ms. (steps per millisecond=171 )
Probabilistic random walk after 16950 steps, saw 12674 distinct states, run finished after 99 ms. (steps per millisecond=171 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 16918 steps, run visited all 1 properties in 91 ms. (steps per millisecond=185 )
Probabilistic random walk after 16918 steps, saw 12646 distinct states, run finished after 91 ms. (steps per millisecond=185 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 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 16926 steps, run visited all 1 properties in 98 ms. (steps per millisecond=172 )
Probabilistic random walk after 16926 steps, saw 12653 distinct states, run finished after 98 ms. (steps per millisecond=172 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 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 16934 steps, run visited all 1 properties in 94 ms. (steps per millisecond=180 )
Probabilistic random walk after 16934 steps, saw 12660 distinct states, run finished after 94 ms. (steps per millisecond=180 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 6190 steps, run visited all 1 properties in 39 ms. (steps per millisecond=158 )
Probabilistic random walk after 6190 steps, saw 4788 distinct states, run finished after 39 ms. (steps per millisecond=158 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 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 6198 steps, run visited all 1 properties in 37 ms. (steps per millisecond=167 )
Probabilistic random walk after 6198 steps, saw 4795 distinct states, run finished after 37 ms. (steps per millisecond=167 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 6206 steps, run visited all 1 properties in 38 ms. (steps per millisecond=163 )
Probabilistic random walk after 6206 steps, saw 4802 distinct states, run finished after 38 ms. (steps per millisecond=163 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 6174 steps, run visited all 1 properties in 36 ms. (steps per millisecond=171 )
Probabilistic random walk after 6174 steps, saw 4774 distinct states, run finished after 36 ms. (steps per millisecond=171 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 6182 steps, run visited all 1 properties in 38 ms. (steps per millisecond=162 )
Probabilistic random walk after 6182 steps, saw 4781 distinct states, run finished after 39 ms. (steps per millisecond=158 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 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 1846 steps, run visited all 1 properties in 13 ms. (steps per millisecond=142 )
Probabilistic random walk after 1846 steps, saw 1516 distinct states, run finished after 13 ms. (steps per millisecond=142 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 1854 steps, run visited all 1 properties in 15 ms. (steps per millisecond=123 )
Probabilistic random walk after 1854 steps, saw 1523 distinct states, run finished after 15 ms. (steps per millisecond=123 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 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 1862 steps, run visited all 1 properties in 13 ms. (steps per millisecond=143 )
Probabilistic random walk after 1862 steps, saw 1530 distinct states, run finished after 13 ms. (steps per millisecond=143 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 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 1870 steps, run visited all 1 properties in 15 ms. (steps per millisecond=124 )
Probabilistic random walk after 1870 steps, saw 1537 distinct states, run finished after 16 ms. (steps per millisecond=116 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 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 1838 steps, run visited all 1 properties in 12 ms. (steps per millisecond=153 )
Probabilistic random walk after 1838 steps, saw 1509 distinct states, run finished after 12 ms. (steps per millisecond=153 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 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 518 steps, run visited all 1 properties in 8 ms. (steps per millisecond=64 )
Probabilistic random walk after 518 steps, saw 445 distinct states, run finished after 8 ms. (steps per millisecond=64 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 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 526 steps, run visited all 1 properties in 5 ms. (steps per millisecond=105 )
Probabilistic random walk after 526 steps, saw 452 distinct states, run finished after 6 ms. (steps per millisecond=87 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 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 534 steps, run visited all 1 properties in 8 ms. (steps per millisecond=66 )
Probabilistic random walk after 534 steps, saw 459 distinct states, run finished after 8 ms. (steps per millisecond=66 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 542 steps, run visited all 1 properties in 7 ms. (steps per millisecond=77 )
Probabilistic random walk after 542 steps, saw 466 distinct states, run finished after 7 ms. (steps per millisecond=77 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 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 550 steps, run visited all 1 properties in 10 ms. (steps per millisecond=55 )
Probabilistic random walk after 550 steps, saw 473 distinct states, run finished after 10 ms. (steps per millisecond=55 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 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 158 steps, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Probabilistic random walk after 158 steps, saw 141 distinct states, run finished after 4 ms. (steps per millisecond=39 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 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 166 steps, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Probabilistic random walk after 166 steps, saw 148 distinct states, run finished after 4 ms. (steps per millisecond=41 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 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 174 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 4 ms. (steps per millisecond=43 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 204 edges and 342 vertex of which 15 / 342 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 962 transitions
Reduce isomorphic transitions removed 987 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 334 transition count 701
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 321 transition count 695
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 315 transition count 695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 315 transition count 694
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 314 transition count 694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 312 transition count 692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 311 transition count 711
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 67 place count 311 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 178 transitions
Redundant transition composition rules discarded 178 transitions
Iterating global reduction 4 with 178 rules applied. Total rules applied 245 place count 311 transition count 513
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 305 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 291 place count 305 transition count 533
Free-agglomeration rule applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 338 place count 305 transition count 486
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 385 place count 258 transition count 486
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 391 place count 258 transition count 486
Applied a total of 391 rules in 53 ms. Remains 258 /342 variables (removed 84) and now considering 486/1701 (removed 1215) transitions.
Running SMT prover for 951 properties.
// Phase 1: matrix 486 rows 258 cols
[2025-06-01 01:53:46] [INFO ] Computed 22 invariants in 4 ms
[2025-06-01 01:53:50] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-01 01:53:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-01 01:54:14] [INFO ] After 28361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:951
[2025-06-01 01:54:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:54:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:54:38] [INFO ] After 15773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :951
TRAPS : Iteration 0
[2025-06-01 01:54:38] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-01 01:55:00] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-01 01:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 1
[2025-06-01 01:55:28] [INFO ] After 66352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :951
[2025-06-01 01:55:44] [INFO ] After 89901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :951
Over-approximation ignoring read arcs solved 0 properties in 118733 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :951 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 951 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1481100 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-07

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 553
TRANSITIONS: 1960
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 9212
NUPN UNITS: 17
LOADING TIME: 0.862

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.077
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.426
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 6669
MODEL NAME: /home/mcc/execution/model
553 places, 1960 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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