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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 3.8K 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 460K 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 1748741212983

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:26:54] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2025-06-01 01:26:54] [INFO ] Transformed 295 places.
[2025-06-01 01:26:55] [INFO ] Transformed 800 transitions.
[2025-06-01 01:26:55] [INFO ] Found NUPN structural information;
[2025-06-01 01:26:55] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 412 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 695
Applied a total of 210 rules in 223 ms. Remains 190 /295 variables (removed 105) and now considering 695/800 (removed 105) transitions.
[2025-06-01 01:26:55] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
// Phase 1: matrix 360 rows 190 cols
[2025-06-01 01:26:55] [INFO ] Computed 16 invariants in 12 ms
[2025-06-01 01:26:56] [INFO ] Implicit Places using invariants in 793 ms returned []
[2025-06-01 01:26:56] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:26:56] [INFO ] Invariant cache hit.
[2025-06-01 01:26:56] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 01:26:57] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-06-01 01:26:57] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:26:57] [INFO ] Invariant cache hit.
[2025-06-01 01:26:57] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 23 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 2 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 3 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 8 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 9 ms to minimize.
[2025-06-01 01:27:05] [INFO ] Deduced a trap composed of 47 places in 687 ms of which 15 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 51 places in 361 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:27:07] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:10] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:27:10] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:27:10] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:27:10] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 4 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 3 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 5 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 306 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30028 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 100/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:37] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:40] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:27:42] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:27:42] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:27:42] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:27:49] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:51] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:27:52] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:27:52] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:27:53] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 376 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30017 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 170/170 constraints]
After SMT, in 60689ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60740ms
Starting structural reductions in LIVENESS mode, iteration 1 : 190/295 places, 695/800 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62863 ms. Remains : 190/295 places, 695/800 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 2431 ms. (16 steps per ms) remains 486/690 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 486/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 485/486 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 485/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/485 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 484/484 properties
[2025-06-01 01:27:58] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:27:58] [INFO ] Invariant cache hit.
[2025-06-01 01:27:58] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (OVERLAPS) 56/190 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 56/201 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 484 unsolved
[2025-06-01 01:28:03] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:28:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:28:03] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:28:03] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:28:03] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:28:04] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:28:04] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:28:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:28:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
SMT process timed out in 5244ms, After SMT, problems are : Problem set: 0 solved, 484 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 134 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Applied a total of 0 rules in 40 ms. Remains 190 /190 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 190/190 places, 695/695 transitions.
RANDOM walk for 4000000 steps (8 resets) in 106016 ms. (37 steps per ms) remains 466/484 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 466/466 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 466/466 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 466/466 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 465/466 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 462/465 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 457/462 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 456/457 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 453/456 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 453/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 447/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 447/447 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 445/447 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 443/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 442/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 442/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 442/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 442/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 442/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 442/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 441/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 440/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 439/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 439/439 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 439/439 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 438/439 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 436/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 435/436 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 431/435 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 425/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 425/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 425/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 420/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 420/420 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 420/420 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 414/420 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 409/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 407/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 407/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 407/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 406/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 405/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 404/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 401/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 399/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 398/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 398/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 395/398 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 394/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 393/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 392/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 391/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 390/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 383/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 383/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/383 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 382/382 properties
[2025-06-01 01:28:59] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:28:59] [INFO ] Invariant cache hit.
[2025-06-01 01:28:59] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 77/190 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 77/201 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:29:05] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:29:05] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:06] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:06] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:29:13] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:29:13] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 3 ms to minimize.
[2025-06-01 01:29:13] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:13] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:29:13] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:14] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:29:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:29:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:29:15] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 4 ms to minimize.
[2025-06-01 01:29:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:29:15] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 19/285 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:29:20] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:29:20] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:20] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:29:20] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:29:21] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 13/298 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:27] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:29:27] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:29:27] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:29:30] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 10/328 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 17/345 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:40] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:29:41] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 13/358 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2025-06-01 01:29:42] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:29:42] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:29:43] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:29:43] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:29:43] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:29:43] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:44] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:44] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:29:45] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:29:45] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
SMT process timed out in 45241ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Fused 382 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 113 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 685
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 685
Applied a total of 4 rules in 28 ms. Remains 188 /190 variables (removed 2) and now considering 685/695 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 188/190 places, 685/695 transitions.
RANDOM walk for 4000000 steps (8 resets) in 88615 ms. (45 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 380/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 380/380 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 380/380 properties
Interrupted probabilistic random walk after 9565452 steps, run timeout after 81001 ms. (steps per millisecond=118 ) properties seen :258 out of 380
Probabilistic random walk after 9565452 steps, saw 1684515 distinct states, run finished after 81011 ms. (steps per millisecond=118 ) properties seen :258
[2025-06-01 01:31:33] [INFO ] Flow matrix only has 350 transitions (discarded 335 similar events)
// Phase 1: matrix 350 rows 188 cols
[2025-06-01 01:31:33] [INFO ] Computed 16 invariants in 4 ms
[2025-06-01 01:31:33] [INFO ] State equation strengthened by 188 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 135/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:34] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:31:34] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:31:34] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:31:34] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:31:34] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:31:35] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:31:36] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:31:37] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:38] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:31:38] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:31:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:31:38] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:31:39] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:39] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:31:40] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:40] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 350/538 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 188/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:42] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/538 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 435 constraints, problems are : Problem set: 0 solved, 122 unsolved in 15730 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 135/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 350/538 variables, 188/250 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 188/438 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 122/560 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:31:53] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:31:59] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/538 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/538 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 18 (OVERLAPS) 0/538 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 569 constraints, problems are : Problem set: 0 solved, 122 unsolved in 33872 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 55/55 constraints]
After SMT, in 49664ms problems are : Problem set: 0 solved, 122 unsolved
Parikh walk visited 4 properties in 4824 ms.
Support contains 53 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 685/685 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 600
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 600
Applied a total of 34 rules in 28 ms. Remains 171 /188 variables (removed 17) and now considering 600/685 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 171/188 places, 600/685 transitions.
RANDOM walk for 4000000 steps (8 resets) in 43308 ms. (92 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 118/118 properties
Interrupted probabilistic random walk after 5609700 steps, run timeout after 42001 ms. (steps per millisecond=133 ) properties seen :9 out of 118
Probabilistic random walk after 5609700 steps, saw 965267 distinct states, run finished after 42003 ms. (steps per millisecond=133 ) properties seen :9
[2025-06-01 01:33:23] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2025-06-01 01:33:23] [INFO ] Computed 16 invariants in 9 ms
[2025-06-01 01:33:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 124/171 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 265/436 variables, 171/206 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 120/326 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-01 01:33:27] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 327 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8283 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 124/171 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 265/436 variables, 171/208 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 120/328 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 109/437 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/436 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 443 constraints, problems are : Problem set: 0 solved, 109 unsolved in 10846 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 27/27 constraints]
After SMT, in 19196ms problems are : Problem set: 0 solved, 109 unsolved
Parikh walk visited 0 properties in 3720 ms.
Support contains 47 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 600/600 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 170 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 22 ms. Remains 170 /171 variables (removed 1) and now considering 595/600 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/171 places, 595/600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 38848 ms. (102 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
Interrupted probabilistic random walk after 4708104 steps, run timeout after 33001 ms. (steps per millisecond=142 ) properties seen :0 out of 108
Probabilistic random walk after 4708104 steps, saw 813055 distinct states, run finished after 33002 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-01 01:34:30] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2025-06-01 01:34:30] [INFO ] Computed 16 invariants in 2 ms
[2025-06-01 01:34:30] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:34:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7811 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 108/426 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/430 variables, 6/432 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/430 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 432 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10166 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 22/22 constraints]
After SMT, in 18026ms problems are : Problem set: 0 solved, 108 unsolved
Fused 108 Parikh solutions to 105 different solutions.
Parikh walk visited 0 properties in 4012 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39536 ms. (101 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
Interrupted probabilistic random walk after 4362402 steps, run timeout after 33001 ms. (steps per millisecond=132 ) properties seen :0 out of 108
Probabilistic random walk after 4362402 steps, saw 755445 distinct states, run finished after 33001 ms. (steps per millisecond=132 ) properties seen :0
[2025-06-01 01:35:37] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:35:37] [INFO ] Invariant cache hit.
[2025-06-01 01:35:37] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7626 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 108/426 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:49] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:51] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:35:51] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:35:52] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:53] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 01:35:56] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:35:56] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 0/430 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 440 constraints, problems are : Problem set: 0 solved, 108 unsolved in 18043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 30/30 constraints]
After SMT, in 25715ms problems are : Problem set: 0 solved, 108 unsolved
Parikh walk visited 0 properties in 5171 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 22 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2025-06-01 01:36:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:36:08] [INFO ] Invariant cache hit.
[2025-06-01 01:36:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-01 01:36:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:36:08] [INFO ] Invariant cache hit.
[2025-06-01 01:36:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:36:08] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2025-06-01 01:36:08] [INFO ] Redundant transitions in 33 ms returned []
Running 590 sub problems to find dead transitions.
[2025-06-01 01:36:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:36:08] [INFO ] Invariant cache hit.
[2025-06-01 01:36:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:12] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:14] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:36:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:36:15] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:36:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:36:15] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:17] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:36:17] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:18] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:36:18] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:36:18] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:19] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:36:20] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:36:20] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:36:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:36:20] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:36:20] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:36:22] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:36:23] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:36:23] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:36:23] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:36:23] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:36:23] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:26] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:36:27] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:32] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:36:32] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:36:33] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:36:33] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:36:34] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:34] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:34] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:36:34] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:36:34] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 103 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:36:41] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:36:42] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:36:43] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:36:43] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:53] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:36:53] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:55] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:36:55] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:36:55] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 17/159 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:37:09] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
SMT process timed out in 60326ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60756 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 3447 ms. (116 steps per ms) remains 13/47 properties
Running SMT prover for 13 properties.
[2025-06-01 01:37:10] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:37:10] [INFO ] Invariant cache hit.
[2025-06-01 01:37:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-01 01:37:10] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:37:10] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2025-06-01 01:37:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:37:10] [INFO ] After 40ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:37:10] [INFO ] After 284ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:37:10] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:37:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-01 01:37:10] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:37:10] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2025-06-01 01:37:10] [INFO ] After 47ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:37:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
TRAPS : Iteration 1
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 2
[2025-06-01 01:37:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 3
[2025-06-01 01:37:12] [INFO ] After 1735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2025-06-01 01:37:12] [INFO ] After 1909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
RANDOM walk for 4000000 steps (8 resets) in 42508 ms. (94 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 107/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 107/107 properties
Interrupted probabilistic random walk after 4878948 steps, run timeout after 45001 ms. (steps per millisecond=108 ) properties seen :0 out of 107
Probabilistic random walk after 4878948 steps, saw 841219 distinct states, run finished after 45001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-01 01:38:13] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:38:13] [INFO ] Invariant cache hit.
[2025-06-01 01:38:13] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 316 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7638 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 260/430 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 116/320 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 107/427 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:38:25] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 5/437 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/430 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 439 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20855 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 30/30 constraints]
After SMT, in 28555ms problems are : Problem set: 0 solved, 107 unsolved
Parikh walk visited 0 properties in 1900 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 76946 ms. (51 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 107/107 properties
Interrupted probabilistic random walk after 8271612 steps, run timeout after 75001 ms. (steps per millisecond=110 ) properties seen :16 out of 107
Probabilistic random walk after 8271612 steps, saw 1394388 distinct states, run finished after 75003 ms. (steps per millisecond=110 ) properties seen :16
[2025-06-01 01:40:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:40:24] [INFO ] Invariant cache hit.
[2025-06-01 01:40:24] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/199 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 315 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6534 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 260/430 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 116/317 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 91/408 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/430 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 15 (OVERLAPS) 0/430 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 412 constraints, problems are : Problem set: 0 solved, 91 unsolved in 12373 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
After SMT, in 18953ms problems are : Problem set: 0 solved, 91 unsolved
Parikh walk visited 0 properties in 8520 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 65618 ms. (60 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1221 ms. (327 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1363 ms. (293 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1241 ms. (322 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1098 ms. (363 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1385 ms. (288 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1086 ms. (367 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1279 ms. (312 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1019 ms. (392 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1362 ms. (293 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1227 ms. (325 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1313 ms. (304 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1266 ms. (315 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1136 ms. (351 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 978 ms. (408 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 956 ms. (417 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1047 ms. (381 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1033 ms. (386 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1237 ms. (323 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1025 ms. (389 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1096 ms. (364 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1244 ms. (321 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1651 ms. (242 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1103 ms. (362 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1100 ms. (363 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1138 ms. (351 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1167 ms. (342 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 994 ms. (402 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1223 ms. (326 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1191 ms. (335 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1094 ms. (365 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1123 ms. (355 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1219 ms. (327 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1096 ms. (364 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1071 ms. (373 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1290 ms. (309 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1143 ms. (349 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1106 ms. (361 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1008 ms. (396 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1414 ms. (282 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1493 ms. (267 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1217 ms. (328 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1252 ms. (319 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1275 ms. (313 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1069 ms. (373 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1095 ms. (364 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1171 ms. (341 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 977 ms. (409 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1128 ms. (354 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1248 ms. (320 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1210 ms. (330 steps per ms) remains 91/91 properties
Interrupted probabilistic random walk after 13747800 steps, run timeout after 120001 ms. (steps per millisecond=114 ) properties seen :30 out of 91
Probabilistic random walk after 13747800 steps, saw 2292709 distinct states, run finished after 120001 ms. (steps per millisecond=114 ) properties seen :30
[2025-06-01 01:43:32] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:43:32] [INFO ] Invariant cache hit.
[2025-06-01 01:43:32] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 125/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 5/170 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 316 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4239 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 125/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 5/170 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 260/430 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 116/317 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 61/378 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 381 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 18/18 constraints]
After SMT, in 8835ms problems are : Problem set: 0 solved, 61 unsolved
Parikh walk visited 0 properties in 6094 ms.
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 57767 ms. (69 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 952 ms. (419 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1025 ms. (389 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1092 ms. (365 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1134 ms. (352 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 989 ms. (404 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 896 ms. (445 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1086 ms. (367 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 862 ms. (463 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 960 ms. (416 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1077 ms. (371 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 934 ms. (427 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 962 ms. (415 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1089 ms. (366 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 941 ms. (424 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1017 ms. (392 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1114 ms. (358 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 936 ms. (426 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 962 ms. (415 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 989 ms. (404 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1199 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 968 ms. (412 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1138 ms. (351 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1123 ms. (355 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1072 ms. (372 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 925 ms. (431 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 954 ms. (418 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 968 ms. (412 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1112 ms. (359 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1096 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1065 ms. (375 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1113 ms. (359 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1077 ms. (371 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1109 ms. (360 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1062 ms. (376 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1090 ms. (366 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1144 ms. (349 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 952 ms. (419 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 967 ms. (413 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1040 ms. (384 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1119 ms. (357 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 869 ms. (459 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1019 ms. (392 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1047 ms. (381 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1040 ms. (384 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 961 ms. (415 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1056 ms. (378 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1010 ms. (395 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 993 ms. (402 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 985 ms. (405 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 12955092 steps, run timeout after 105001 ms. (steps per millisecond=123 ) properties seen :0 out of 61
Probabilistic random walk after 12955092 steps, saw 2160603 distinct states, run finished after 105001 ms. (steps per millisecond=123 ) properties seen :0
[2025-06-01 01:46:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:46:08] [INFO ] Invariant cache hit.
[2025-06-01 01:46:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 125/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:46:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 5/170 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 316 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4269 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 125/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:46:12] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 5/170 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 260/430 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 116/317 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 61/378 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:46:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 381 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4635 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 18/18 constraints]
After SMT, in 8934ms problems are : Problem set: 0 solved, 61 unsolved
Parikh walk visited 0 properties in 6853 ms.
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2025-06-01 01:46:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:46:24] [INFO ] Invariant cache hit.
[2025-06-01 01:46:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-01 01:46:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:46:24] [INFO ] Invariant cache hit.
[2025-06-01 01:46:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:46:24] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2025-06-01 01:46:24] [INFO ] Redundant transitions in 8 ms returned []
Running 590 sub problems to find dead transitions.
[2025-06-01 01:46:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:46:24] [INFO ] Invariant cache hit.
[2025-06-01 01:46:24] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:46:36] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:46:38] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:46:39] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
(s39 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 103 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:46:58] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:46:59] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:46:59] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:47:10] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 17/159 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 167 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 151/151 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60681 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 3147 ms. (127 steps per ms) remains 14/40 properties
Running SMT prover for 14 properties.
[2025-06-01 01:47:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:47:26] [INFO ] Invariant cache hit.
[2025-06-01 01:47:26] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:47:26] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:47:26] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2025-06-01 01:47:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:47:26] [INFO ] After 39ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2025-06-01 01:47:26] [INFO ] After 324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2025-06-01 01:47:26] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2025-06-01 01:47:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:47:26] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-01 01:47:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2025-06-01 01:47:26] [INFO ] After 47ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 280 ms
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2025-06-01 01:47:27] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
TRAPS : Iteration 2
[2025-06-01 01:47:28] [INFO ] After 1373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2025-06-01 01:47:28] [INFO ] After 1546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
RANDOM walk for 497 steps (0 resets) in 11 ms. (41 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 36697 steps (8 resets) in 154 ms. (236 steps per ms) remains 0/1 properties
RANDOM walk for 759 steps (0 resets) in 8 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 31 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1041 steps (0 resets) in 10 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17332 steps, run visited all 1 properties in 62 ms. (steps per millisecond=279 )
Probabilistic random walk after 17332 steps, saw 8436 distinct states, run finished after 67 ms. (steps per millisecond=258 ) properties seen :1
RANDOM walk for 30032 steps (6 resets) in 127 ms. (234 steps per ms) remains 0/1 properties
RANDOM walk for 31449 steps (6 resets) in 130 ms. (240 steps per ms) remains 0/1 properties
RANDOM walk for 3495 steps (0 resets) in 19 ms. (174 steps per ms) remains 0/1 properties
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28246 steps, run visited all 1 properties in 90 ms. (steps per millisecond=313 )
Probabilistic random walk after 28246 steps, saw 11508 distinct states, run finished after 90 ms. (steps per millisecond=313 ) 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 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8344 steps, run visited all 1 properties in 30 ms. (steps per millisecond=278 )
Probabilistic random walk after 8344 steps, saw 4781 distinct states, run finished after 31 ms. (steps per millisecond=269 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 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 3304 steps, run visited all 1 properties in 22 ms. (steps per millisecond=150 )
Probabilistic random walk after 3304 steps, saw 2268 distinct states, run finished after 22 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6724 steps, run visited all 1 properties in 25 ms. (steps per millisecond=268 )
Probabilistic random walk after 6724 steps, saw 4080 distinct states, run finished after 26 ms. (steps per millisecond=258 ) properties seen :1
RANDOM walk for 26413 steps (5 resets) in 89 ms. (293 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 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 1096 steps, run visited all 1 properties in 7 ms. (steps per millisecond=156 )
Probabilistic random walk after 1096 steps, saw 847 distinct states, run finished after 7 ms. (steps per millisecond=156 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 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 44206 steps, run visited all 1 properties in 142 ms. (steps per millisecond=311 )
Probabilistic random walk after 44206 steps, saw 15198 distinct states, run finished after 142 ms. (steps per millisecond=311 ) 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 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4876 steps, run visited all 1 properties in 18 ms. (steps per millisecond=270 )
Probabilistic random walk after 4876 steps, saw 3118 distinct states, run finished after 19 ms. (steps per millisecond=256 ) 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 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7456 steps, run visited all 1 properties in 26 ms. (steps per millisecond=286 )
Probabilistic random walk after 7456 steps, saw 4364 distinct states, run finished after 26 ms. (steps per millisecond=286 ) properties seen :1
RANDOM walk for 18150 steps (4 resets) in 69 ms. (259 steps per ms) remains 0/1 properties
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
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 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46576 steps, run visited all 1 properties in 146 ms. (steps per millisecond=319 )
Probabilistic random walk after 46576 steps, saw 15890 distinct states, run finished after 146 ms. (steps per millisecond=319 ) properties seen :1
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 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9652 steps, run visited all 1 properties in 33 ms. (steps per millisecond=292 )
Probabilistic random walk after 9652 steps, saw 5422 distinct states, run finished after 33 ms. (steps per millisecond=292 ) 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 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5362 steps, run visited all 1 properties in 21 ms. (steps per millisecond=255 )
Probabilistic random walk after 5362 steps, saw 3402 distinct states, run finished after 21 ms. (steps per millisecond=255 ) properties seen :1
RANDOM walk for 272 steps (0 resets) in 5 ms. (45 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 28515 steps (6 resets) in 96 ms. (293 steps per ms) remains 0/1 properties
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 226 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/1 properties
RANDOM walk for 590 steps (0 resets) in 6 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 797 steps (0 resets) in 7 ms. (99 steps per ms) remains 0/1 properties
RANDOM walk for 1011 steps (0 resets) in 9 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 225 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/1 properties
RANDOM walk for 425 steps (0 resets) in 7 ms. (53 steps per ms) remains 0/1 properties
RANDOM walk for 586 steps (0 resets) in 6 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 963 steps (0 resets) in 10 ms. (87 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 224 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 150 transition count 185
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 135 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 135 transition count 174
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 58 place count 119 transition count 174
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 92 place count 102 transition count 157
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 97 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 97 transition count 230
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 97 transition count 214
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 136 place count 81 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 141 place count 81 transition count 214
Applied a total of 141 rules in 25 ms. Remains 81 /170 variables (removed 89) and now considering 214/595 (removed 381) transitions.
Running SMT prover for 61 properties.
// Phase 1: matrix 214 rows 81 cols
[2025-06-01 01:47:29] [INFO ] Computed 11 invariants in 2 ms
[2025-06-01 01:47:30] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-01 01:47:30] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:61
[2025-06-01 01:47:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-01 01:47:31] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :61
[2025-06-01 01:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 01:47:32] [INFO ] After 553ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :61
TRAPS : Iteration 0
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2025-06-01 01:47:33] [INFO ] After 2276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :61
[2025-06-01 01:47:34] [INFO ] After 3660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :61
Over-approximation ignoring read arcs solved 0 properties in 4623 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :61 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 61 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1239900 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-05

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 295
TRANSITIONS: 800
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3600
NUPN UNITS: 13
LOADING TIME: 0.773

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.043
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.159
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: 3367
MODEL NAME: /home/mcc/execution/model
295 places, 800 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-05"
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-05, 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-174860080700482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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