MCC'2025- Execution of r098-smll-174860112300212

About the Execution of 2024-gold for FireWire-PT-13

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15688.200	1800000.00	3119671.00	4526.50	[undef]	Time out reached

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r098-smll-174860112300212.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 FireWire-PT-13, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K 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 1748680082770

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:28:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 08:28:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:28:05] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-05-31 08:28:05] [INFO ] Transformed 205 places.
[2025-05-31 08:28:05] [INFO ] Transformed 610 transitions.
[2025-05-31 08:28:05] [INFO ] Found NUPN structural information;
[2025-05-31 08:28:05] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 366 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 205/205 places, 610/610 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 205 transition count 542
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 68 place count 205 transition count 539
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 202 transition count 539
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 199 transition count 536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 196 transition count 542
Applied a total of 86 rules in 162 ms. Remains 196 /205 variables (removed 9) and now considering 542/610 (removed 68) transitions.
[2025-05-31 08:28:05] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 196 cols
[2025-05-31 08:28:05] [INFO ] Computed 10 invariants in 94 ms
[2025-05-31 08:28:06] [INFO ] Implicit Places using invariants in 860 ms returned []
[2025-05-31 08:28:06] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
[2025-05-31 08:28:06] [INFO ] Invariant cache hit.
[2025-05-31 08:28:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 08:28:07] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned [19, 80, 141]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 2084 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 193/205 places, 542/610 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2300 ms. Remains : 193/205 places, 542/610 transitions.
Discarding 159 transitions out of 542. Remains 383
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1223 resets) in 4739 ms. (8 steps per ms) remains 175/382 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 175/175 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 175/175 properties
[2025-05-31 08:28:09] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 193 cols
[2025-05-31 08:28:09] [INFO ] Computed 7 invariants in 9 ms
[2025-05-31 08:28:09] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 78/193 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 78/200 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-05-31 08:28:13] [INFO ] Deduced a trap composed of 35 places in 386 ms of which 51 ms to minimize.
[2025-05-31 08:28:14] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 5 ms to minimize.
[2025-05-31 08:28:14] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2025-05-31 08:28:14] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2025-05-31 08:28:14] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 5834ms, After SMT, problems are : Problem set: 0 solved, 175 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 193 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 193 transition count 524
Applied a total of 18 rules in 106 ms. Remains 193 /193 variables (removed 0) and now considering 524/542 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 193/193 places, 524/542 transitions.
RANDOM walk for 4000000 steps (124906 resets) in 49083 ms. (81 steps per ms) remains 108/175 properties
BEST_FIRST walk for 40002 steps (274 resets) in 127 ms. (312 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (45 resets) in 126 ms. (314 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (276 resets) in 142 ms. (279 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (385 resets) in 134 ms. (296 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (273 resets) in 178 ms. (223 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (43 resets) in 140 ms. (283 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (256 resets) in 143 ms. (277 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (399 resets) in 151 ms. (263 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (287 resets) in 142 ms. (279 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (44 resets) in 141 ms. (281 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (252 resets) in 136 ms. (292 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (393 resets) in 146 ms. (272 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (269 resets) in 138 ms. (287 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (44 resets) in 203 ms. (196 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (260 resets) in 153 ms. (259 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (383 resets) in 166 ms. (239 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (294 resets) in 153 ms. (259 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (43 resets) in 188 ms. (211 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (258 resets) in 152 ms. (261 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (380 resets) in 156 ms. (254 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (275 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (47 resets) in 139 ms. (285 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (259 resets) in 150 ms. (264 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (382 resets) in 129 ms. (307 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (292 resets) in 127 ms. (312 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (273 resets) in 146 ms. (272 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (277 resets) in 130 ms. (305 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (266 resets) in 136 ms. (292 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (279 resets) in 126 ms. (314 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (269 resets) in 126 ms. (314 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (46 resets) in 146 ms. (272 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (274 resets) in 131 ms. (303 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (289 resets) in 150 ms. (264 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (262 resets) in 149 ms. (266 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (259 resets) in 154 ms. (258 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (39 resets) in 190 ms. (209 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (275 resets) in 149 ms. (266 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (373 resets) in 154 ms. (258 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (289 resets) in 163 ms. (243 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (37 resets) in 221 ms. (180 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (269 resets) in 147 ms. (270 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (385 resets) in 142 ms. (279 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (263 resets) in 119 ms. (333 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (33 resets) in 156 ms. (254 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (270 resets) in 121 ms. (327 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (395 resets) in 119 ms. (333 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (285 resets) in 117 ms. (339 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (49 resets) in 147 ms. (270 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (277 resets) in 122 ms. (325 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (384 resets) in 121 ms. (327 steps per ms) remains 108/108 properties
[2025-05-31 08:28:30] [INFO ] Flow matrix only has 490 transitions (discarded 34 similar events)
// Phase 1: matrix 490 rows 193 cols
[2025-05-31 08:28:30] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:28:30] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 114/191 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 114/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-31 08:28:32] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2025-05-31 08:28:32] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2025-05-31 08:28:32] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
[2025-05-31 08:28:32] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2025-05-31 08:28:33] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 490/681 variables, 191/394 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 74/468 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 2/683 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/683 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/683 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/683 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 472 constraints, problems are : Problem set: 0 solved, 108 unsolved in 24667 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 114/191 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 114/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 490/681 variables, 191/394 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 74/468 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 107/575 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-31 08:29:03] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-31 08:29:11] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-05-31 08:29:16] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 2/683 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 583 constraints, problems are : Problem set: 0 solved, 108 unsolved in 45031 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 8/8 constraints]
After SMT, in 69947ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 524/524 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 518
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 518
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 190 transition count 515
Applied a total of 9 rules in 52 ms. Remains 190 /193 variables (removed 3) and now considering 515/524 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 190/193 places, 515/524 transitions.
RANDOM walk for 4000000 steps (124347 resets) in 42126 ms. (94 steps per ms) remains 103/108 properties
BEST_FIRST walk for 40002 steps (288 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (51 resets) in 95 ms. (416 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (275 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (369 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (287 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (48 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (266 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (384 resets) in 114 ms. (347 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (276 resets) in 101 ms. (392 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (50 resets) in 96 ms. (412 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (266 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (389 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (269 resets) in 101 ms. (392 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (40 resets) in 113 ms. (350 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (285 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (388 resets) in 129 ms. (307 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (257 resets) in 129 ms. (307 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (53 resets) in 127 ms. (312 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (257 resets) in 128 ms. (310 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (390 resets) in 130 ms. (305 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (270 resets) in 126 ms. (314 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (46 resets) in 139 ms. (285 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (276 resets) in 134 ms. (296 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (376 resets) in 135 ms. (294 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (298 resets) in 127 ms. (312 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (240 resets) in 124 ms. (320 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (275 resets) in 121 ms. (327 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (272 resets) in 126 ms. (314 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (269 resets) in 121 ms. (327 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (291 resets) in 126 ms. (314 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (268 resets) in 124 ms. (320 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (291 resets) in 126 ms. (314 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (271 resets) in 125 ms. (317 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (264 resets) in 129 ms. (307 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (270 resets) in 124 ms. (320 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (387 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (285 resets) in 101 ms. (392 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (50 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (253 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (371 resets) in 115 ms. (344 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (268 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (51 resets) in 98 ms. (404 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (252 resets) in 216 ms. (184 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (380 resets) in 166 ms. (239 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (265 resets) in 216 ms. (184 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (41 resets) in 179 ms. (222 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (263 resets) in 225 ms. (177 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (377 resets) in 284 ms. (140 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (286 resets) in 289 ms. (137 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (36 resets) in 200 ms. (199 steps per ms) remains 103/103 properties
Interrupted probabilistic random walk after 2958838 steps, run timeout after 39001 ms. (steps per millisecond=75 ) properties seen :23 out of 103
Probabilistic random walk after 2958838 steps, saw 663601 distinct states, run finished after 39012 ms. (steps per millisecond=75 ) properties seen :23
[2025-05-31 08:30:32] [INFO ] Flow matrix only has 481 transitions (discarded 34 similar events)
// Phase 1: matrix 481 rows 190 cols
[2025-05-31 08:30:32] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:30:32] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 128/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:30:33] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2025-05-31 08:30:33] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
[2025-05-31 08:30:33] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 4 ms to minimize.
[2025-05-31 08:30:33] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2025-05-31 08:30:33] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2025-05-31 08:30:34] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 3/187 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 481/668 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 74/274 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 3/671 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/671 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 277 constraints, problems are : Problem set: 0 solved, 80 unsolved in 9613 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 128/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 3/187 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:30:43] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 481/668 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 74/275 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 80/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:30:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:30:51] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 3/671 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:31:07] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
[2025-05-31 08:31:08] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/671 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:31:13] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (OVERLAPS) 0/671 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 363 constraints, problems are : Problem set: 0 solved, 80 unsolved in 49408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 59176ms problems are : Problem set: 0 solved, 80 unsolved
Parikh walk visited 0 properties in 12360 ms.
Support contains 56 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 515/515 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 189 transition count 514
Applied a total of 1 rules in 41 ms. Remains 189 /190 variables (removed 1) and now considering 514/515 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 189/190 places, 514/515 transitions.
RANDOM walk for 4000000 steps (128754 resets) in 65465 ms. (61 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2830 resets) in 1488 ms. (268 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (192 resets) in 2641 ms. (151 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2709 resets) in 1701 ms. (235 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (3871 resets) in 1521 ms. (262 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2839 resets) in 1337 ms. (298 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (81 resets) in 3459 ms. (115 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2707 resets) in 1374 ms. (290 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3870 resets) in 1340 ms. (298 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2723 resets) in 1379 ms. (289 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (220 resets) in 2428 ms. (164 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2648 resets) in 1182 ms. (338 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (3879 resets) in 1601 ms. (249 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2800 resets) in 1942 ms. (205 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (228 resets) in 2634 ms. (151 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2622 resets) in 1553 ms. (257 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3860 resets) in 1919 ms. (208 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 1311 ms. (304 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400000 steps (133 resets) in 3241 ms. (123 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2601 resets) in 1597 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (3881 resets) in 1635 ms. (244 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2779 resets) in 1659 ms. (240 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (277 resets) in 2257 ms. (177 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2674 resets) in 1471 ms. (271 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3847 resets) in 1574 ms. (253 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2665 resets) in 1264 ms. (316 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3913 resets) in 1658 ms. (241 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2770 resets) in 1622 ms. (246 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (95 resets) in 3136 ms. (127 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2731 resets) in 1446 ms. (276 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3848 resets) in 1419 ms. (281 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2807 resets) in 1405 ms. (284 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (188 resets) in 2010 ms. (198 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2631 resets) in 1231 ms. (324 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3851 resets) in 1255 ms. (318 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2790 resets) in 1580 ms. (253 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (118 resets) in 3179 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2699 resets) in 1932 ms. (206 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3876 resets) in 1302 ms. (306 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2763 resets) in 1298 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (117 resets) in 3023 ms. (132 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2677 resets) in 1632 ms. (244 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3895 resets) in 1787 ms. (223 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2840 resets) in 1209 ms. (330 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (100 resets) in 3578 ms. (111 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2798 resets) in 1462 ms. (273 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3897 resets) in 1402 ms. (285 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2791 resets) in 1278 ms. (312 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400000 steps (131 resets) in 2511 ms. (159 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2681 resets) in 1275 ms. (313 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3932 resets) in 1516 ms. (263 steps per ms) remains 80/80 properties
Interrupted probabilistic random walk after 12423764 steps, run timeout after 162001 ms. (steps per millisecond=76 ) properties seen :0 out of 80
Probabilistic random walk after 12423764 steps, saw 2711584 distinct states, run finished after 162001 ms. (steps per millisecond=76 ) properties seen :0
[2025-05-31 08:35:20] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2025-05-31 08:35:20] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 08:35:20] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:35:20] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2025-05-31 08:35:21] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2025-05-31 08:35:21] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 3 ms to minimize.
[2025-05-31 08:35:22] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 7/669 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 80 unsolved in 14172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 79/343 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:35:37] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 7/669 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:35:53] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:35:58] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-05-31 08:36:02] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (OVERLAPS) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 355 constraints, problems are : Problem set: 0 solved, 80 unsolved in 44366 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 58659ms problems are : Problem set: 0 solved, 80 unsolved
Parikh walk visited 1 properties in 13149 ms.
Support contains 54 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 17 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128268 resets) in 56862 ms. (70 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (2835 resets) in 1524 ms. (262 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (177 resets) in 2912 ms. (137 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2702 resets) in 1611 ms. (248 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3872 resets) in 1152 ms. (346 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2810 resets) in 1270 ms. (314 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (142 resets) in 2831 ms. (141 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2678 resets) in 1430 ms. (279 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3883 resets) in 1400 ms. (285 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2873 resets) in 1748 ms. (228 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (215 resets) in 2450 ms. (163 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2676 resets) in 1348 ms. (296 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3885 resets) in 1430 ms. (279 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2796 resets) in 1527 ms. (261 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (142 resets) in 2734 ms. (146 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2719 resets) in 1756 ms. (227 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3874 resets) in 1534 ms. (260 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2767 resets) in 1450 ms. (275 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (76 resets) in 3609 ms. (110 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 1586 ms. (252 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3901 resets) in 1221 ms. (327 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2773 resets) in 1249 ms. (320 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (135 resets) in 3404 ms. (117 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2697 resets) in 1449 ms. (275 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3889 resets) in 1774 ms. (225 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2612 resets) in 1231 ms. (324 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3850 resets) in 1523 ms. (262 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2750 resets) in 1371 ms. (291 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (98 resets) in 2944 ms. (135 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2703 resets) in 2005 ms. (199 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3872 resets) in 1486 ms. (269 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2836 resets) in 1329 ms. (300 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (109 resets) in 3552 ms. (112 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2665 resets) in 1622 ms. (246 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 1443 ms. (277 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2849 resets) in 1877 ms. (212 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (225 resets) in 3082 ms. (129 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2635 resets) in 1431 ms. (279 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3860 resets) in 1426 ms. (280 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2795 resets) in 1730 ms. (231 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (130 resets) in 3406 ms. (117 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2746 resets) in 1487 ms. (268 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3875 resets) in 1152 ms. (346 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2768 resets) in 1453 ms. (275 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (219 resets) in 2442 ms. (163 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2720 resets) in 1412 ms. (283 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3840 resets) in 1695 ms. (235 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2751 resets) in 1478 ms. (270 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (103 resets) in 2746 ms. (145 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2661 resets) in 1372 ms. (291 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3876 resets) in 1257 ms. (317 steps per ms) remains 79/79 properties
Interrupted probabilistic random walk after 11524750 steps, run timeout after 150001 ms. (steps per millisecond=76 ) properties seen :0 out of 79
Probabilistic random walk after 11524750 steps, saw 2513797 distinct states, run finished after 150005 ms. (steps per millisecond=76 ) properties seen :0
[2025-05-31 08:39:52] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:39:52] [INFO ] Invariant cache hit.
[2025-05-31 08:39:52] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-31 08:39:53] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 3 ms to minimize.
[2025-05-31 08:39:53] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 4 ms to minimize.
[2025-05-31 08:39:54] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 11/669 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-31 08:40:01] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 79 unsolved in 14427 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-31 08:40:07] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 478/658 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 71/261 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 77/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 11/669 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-31 08:40:18] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2025-05-31 08:40:20] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 353 constraints, problems are : Problem set: 0 solved, 79 unsolved in 26120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 7/7 constraints]
After SMT, in 40651ms problems are : Problem set: 0 solved, 79 unsolved
Fused 79 Parikh solutions to 77 different solutions.
Parikh walk visited 0 properties in 10140 ms.
Support contains 54 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 28 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 189/189 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 13 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2025-05-31 08:40:43] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:40:43] [INFO ] Invariant cache hit.
[2025-05-31 08:40:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 08:40:43] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:40:43] [INFO ] Invariant cache hit.
[2025-05-31 08:40:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 08:40:43] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2025-05-31 08:40:43] [INFO ] Redundant transitions in 38 ms returned []
Running 508 sub problems to find dead transitions.
[2025-05-31 08:40:43] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:40:43] [INFO ] Invariant cache hit.
[2025-05-31 08:40:43] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:40:48] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2025-05-31 08:40:48] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-05-31 08:40:49] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2025-05-31 08:40:49] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 3 ms to minimize.
[2025-05-31 08:40:49] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 3 ms to minimize.
[2025-05-31 08:40:49] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2025-05-31 08:40:50] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
[2025-05-31 08:40:51] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2025-05-31 08:40:53] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/276 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:41:10] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2025-05-31 08:41:11] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 278 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 508/786 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:41:25] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2025-05-31 08:41:26] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2025-05-31 08:41:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 789 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
After SMT, in 61001ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 61010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61659 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12995 resets) in 6182 ms. (64 steps per ms) remains 43/54 properties
Running SMT prover for 43 properties.
[2025-05-31 08:41:47] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:41:47] [INFO ] Invariant cache hit.
[2025-05-31 08:41:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:41:47] [INFO ] After 320ms SMT Verify possible using state equation in real domain returned unsat :0 sat :43
[2025-05-31 08:41:47] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 08:41:47] [INFO ] After 179ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2025-05-31 08:41:49] [INFO ] After 1829ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:43
[2025-05-31 08:41:49] [INFO ] After 2317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2025-05-31 08:41:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:41:49] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :43
[2025-05-31 08:41:49] [INFO ] After 153ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2025-05-31 08:41:50] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2025-05-31 08:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-05-31 08:41:50] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2025-05-31 08:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
TRAPS : Iteration 1
[2025-05-31 08:41:53] [INFO ] After 3760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :43
[2025-05-31 08:41:53] [INFO ] After 4322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :43
RANDOM walk for 4000000 steps (128521 resets) in 56248 ms. (71 steps per ms) remains 77/79 properties
BEST_FIRST walk for 400003 steps (2790 resets) in 1223 ms. (326 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (237 resets) in 2631 ms. (151 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2758 resets) in 1403 ms. (284 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3853 resets) in 1441 ms. (277 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2807 resets) in 1805 ms. (221 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (138 resets) in 2693 ms. (148 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2658 resets) in 1505 ms. (265 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3836 resets) in 1197 ms. (333 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2733 resets) in 1607 ms. (248 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (116 resets) in 2485 ms. (160 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2745 resets) in 1471 ms. (271 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3837 resets) in 1593 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2832 resets) in 1327 ms. (301 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (131 resets) in 2562 ms. (156 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2673 resets) in 1447 ms. (276 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3825 resets) in 1767 ms. (226 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2759 resets) in 1673 ms. (238 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400000 steps (95 resets) in 3606 ms. (110 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2751 resets) in 1434 ms. (278 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3864 resets) in 1317 ms. (303 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2751 resets) in 1436 ms. (278 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (121 resets) in 2967 ms. (134 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2669 resets) in 1527 ms. (261 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2651 resets) in 1765 ms. (226 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (3820 resets) in 1308 ms. (305 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2766 resets) in 1299 ms. (307 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (115 resets) in 2681 ms. (149 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2687 resets) in 1713 ms. (233 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3899 resets) in 1577 ms. (253 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2801 resets) in 1157 ms. (345 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (87 resets) in 3580 ms. (111 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2686 resets) in 1225 ms. (326 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 1338 ms. (298 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (2732 resets) in 1587 ms. (251 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (131 resets) in 2371 ms. (168 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 1891 ms. (211 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3854 resets) in 1345 ms. (297 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2701 resets) in 1559 ms. (256 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (82 resets) in 2562 ms. (156 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (2687 resets) in 1359 ms. (294 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3832 resets) in 1259 ms. (317 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2808 resets) in 1537 ms. (260 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (285 resets) in 3093 ms. (129 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 1498 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3887 resets) in 1442 ms. (277 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2817 resets) in 1495 ms. (267 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (227 resets) in 2979 ms. (134 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (2603 resets) in 1811 ms. (220 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3869 resets) in 1195 ms. (334 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2793 resets) in 1426 ms. (280 steps per ms) remains 77/77 properties
Interrupted probabilistic random walk after 12666465 steps, run timeout after 144001 ms. (steps per millisecond=87 ) properties seen :0 out of 77
Probabilistic random walk after 12666465 steps, saw 2770431 distinct states, run finished after 144002 ms. (steps per millisecond=87 ) properties seen :0
[2025-05-31 08:45:06] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:45:06] [INFO ] Invariant cache hit.
[2025-05-31 08:45:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 127/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:07] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 6 ms to minimize.
[2025-05-31 08:45:07] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2025-05-31 08:45:08] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 476/655 variables, 179/187 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 71/258 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 13/668 variables, 9/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:15] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 1/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 77 unsolved in 19183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 127/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:27] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 476/655 variables, 179/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 71/260 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 76/336 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:30] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:35] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 13/668 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:49] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:45:55] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:46:01] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/668 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/668 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 18 (OVERLAPS) 1/669 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 20 (OVERLAPS) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 354 constraints, problems are : Problem set: 0 solved, 77 unsolved in 62037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 10/10 constraints]
After SMT, in 81321ms problems are : Problem set: 0 solved, 77 unsolved
Parikh walk visited 0 properties in 10471 ms.
Support contains 52 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128202 resets) in 56597 ms. (70 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2759 resets) in 1363 ms. (293 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (169 resets) in 2949 ms. (135 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2656 resets) in 1796 ms. (222 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (3887 resets) in 1270 ms. (314 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2790 resets) in 1271 ms. (314 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (233 resets) in 2747 ms. (145 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2674 resets) in 1342 ms. (297 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3891 resets) in 1448 ms. (276 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2744 resets) in 1628 ms. (245 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (250 resets) in 2859 ms. (139 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2736 resets) in 1678 ms. (238 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3862 resets) in 1584 ms. (252 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2787 resets) in 1253 ms. (318 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (166 resets) in 2739 ms. (145 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2654 resets) in 1410 ms. (283 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3840 resets) in 1372 ms. (291 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2781 resets) in 1315 ms. (303 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400000 steps (167 resets) in 3380 ms. (118 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2745 resets) in 1333 ms. (299 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3862 resets) in 1664 ms. (240 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2732 resets) in 1412 ms. (283 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400000 steps (121 resets) in 2592 ms. (154 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2680 resets) in 1314 ms. (304 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2701 resets) in 1171 ms. (341 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3901 resets) in 1584 ms. (252 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2746 resets) in 1455 ms. (274 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (80 resets) in 2654 ms. (150 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2653 resets) in 1357 ms. (294 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3908 resets) in 1724 ms. (231 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2752 resets) in 1254 ms. (318 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (131 resets) in 3299 ms. (121 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2717 resets) in 1486 ms. (269 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (3882 resets) in 1393 ms. (286 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2812 resets) in 1357 ms. (294 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (81 resets) in 3836 ms. (104 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2628 resets) in 1561 ms. (256 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3883 resets) in 1361 ms. (293 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2766 resets) in 1760 ms. (227 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (171 resets) in 2667 ms. (149 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2731 resets) in 1712 ms. (233 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3879 resets) in 1410 ms. (283 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2832 resets) in 1571 ms. (254 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (201 resets) in 2632 ms. (151 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2679 resets) in 1907 ms. (209 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3822 resets) in 1698 ms. (235 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (2764 resets) in 1570 ms. (254 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (117 resets) in 2733 ms. (146 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2707 resets) in 1362 ms. (293 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3873 resets) in 1219 ms. (327 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2822 resets) in 1248 ms. (320 steps per ms) remains 77/77 properties
Interrupted probabilistic random walk after 12760173 steps, run timeout after 150001 ms. (steps per millisecond=85 ) properties seen :0 out of 77
Probabilistic random walk after 12760173 steps, saw 2788962 distinct states, run finished after 150001 ms. (steps per millisecond=85 ) properties seen :0
[2025-05-31 08:49:58] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:49:58] [INFO ] Invariant cache hit.
[2025-05-31 08:49:58] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 127/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:49:59] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2025-05-31 08:49:59] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2025-05-31 08:50:00] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 476/655 variables, 179/187 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 71/258 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 13/668 variables, 9/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:07] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 1/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 77 unsolved in 18762 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 127/179 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:19] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 476/655 variables, 179/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 71/260 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 76/336 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:22] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:28] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 13/668 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:42] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:48] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2025-05-31 08:50:55] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/668 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/668 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 18 (OVERLAPS) 1/669 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 20 (OVERLAPS) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 354 constraints, problems are : Problem set: 0 solved, 77 unsolved in 61965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 10/10 constraints]
After SMT, in 80847ms problems are : Problem set: 0 solved, 77 unsolved
Parikh walk visited 0 properties in 9886 ms.
Support contains 52 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2025-05-31 08:51:29] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:51:29] [INFO ] Invariant cache hit.
[2025-05-31 08:51:29] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-31 08:51:29] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:51:29] [INFO ] Invariant cache hit.
[2025-05-31 08:51:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 08:51:30] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2025-05-31 08:51:30] [INFO ] Redundant transitions in 8 ms returned []
Running 508 sub problems to find dead transitions.
[2025-05-31 08:51:30] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:51:30] [INFO ] Invariant cache hit.
[2025-05-31 08:51:30] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:51:35] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2025-05-31 08:51:35] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2025-05-31 08:51:35] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2025-05-31 08:51:35] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 4 ms to minimize.
[2025-05-31 08:51:36] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
[2025-05-31 08:51:36] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 4 ms to minimize.
[2025-05-31 08:51:37] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
[2025-05-31 08:51:38] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2025-05-31 08:51:39] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/276 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:51:58] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2025-05-31 08:51:58] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 278 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 508/786 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-05-31 08:52:13] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2025-05-31 08:52:13] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2025-05-31 08:52:13] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 789 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
After SMT, in 60951ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60960ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61817 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12753 resets) in 5064 ms. (78 steps per ms) remains 42/52 properties
Running SMT prover for 42 properties.
[2025-05-31 08:52:33] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:52:33] [INFO ] Invariant cache hit.
[2025-05-31 08:52:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:52:33] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :42
[2025-05-31 08:52:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 08:52:34] [INFO ] After 143ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :42
TRAPS : Iteration 0
[2025-05-31 08:52:35] [INFO ] After 1653ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:42
[2025-05-31 08:52:35] [INFO ] After 1969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2025-05-31 08:52:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:52:35] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2025-05-31 08:52:36] [INFO ] After 159ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :42
TRAPS : Iteration 0
[2025-05-31 08:52:36] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2025-05-31 08:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2025-05-31 08:52:36] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2025-05-31 08:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 1
[2025-05-31 08:52:38] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2025-05-31 08:52:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 2
[2025-05-31 08:52:39] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 3 ms to minimize.
[2025-05-31 08:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
TRAPS : Iteration 3
[2025-05-31 08:52:42] [INFO ] After 6694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
[2025-05-31 08:52:42] [INFO ] After 7223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
RANDOM walk for 85 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1291 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 795880 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 795880 steps, saw 190878 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2025-05-31 08:52:45] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2025-05-31 08:52:45] [INFO ] Invariant cache hit.
[2025-05-31 08:52:45] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 502
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 66 place count 159 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 159 transition count 444
Applied a total of 72 rules in 146 ms. Remains 159 /189 variables (removed 30) and now considering 444/514 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 159/189 places, 444/514 transitions.
RANDOM walk for 40000 steps (1266 resets) in 403 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (249 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 975481 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 975481 steps, saw 239970 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
[2025-05-31 08:52:50] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2025-05-31 08:52:50] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:52:50] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/386 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/387 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/546 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/564 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/566 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/386 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/387 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/546 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/564 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/566 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 15 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 159/159 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2025-05-31 08:52:50] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-05-31 08:52:50] [INFO ] Invariant cache hit.
[2025-05-31 08:52:51] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-31 08:52:51] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-05-31 08:52:51] [INFO ] Invariant cache hit.
[2025-05-31 08:52:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 08:52:51] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2025-05-31 08:52:51] [INFO ] Redundant transitions in 3 ms returned []
Running 438 sub problems to find dead transitions.
[2025-05-31 08:52:51] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-05-31 08:52:51] [INFO ] Invariant cache hit.
[2025-05-31 08:52:51] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2025-05-31 08:52:55] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 3 ms to minimize.
[2025-05-31 08:52:55] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
[2025-05-31 08:52:55] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2025-05-31 08:52:56] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2025-05-31 08:52:57] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2025-05-31 08:52:57] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2025-05-31 08:52:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-05-31 08:52:58] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2025-05-31 08:52:59] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2025-05-31 08:52:59] [INFO ] Deduced a trap composed of 103 places in 231 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2025-05-31 08:53:10] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2025-05-31 08:53:22] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-05-31 08:53:22] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 240 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/179 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 438/678 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 678 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 13/13 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61622 ms. Remains : 159/159 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 7 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 242
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 227
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 224
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 224
Applied a total of 46 rules in 87 ms. Remains 121 /159 variables (removed 38) and now considering 224/444 (removed 220) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:53:52] [INFO ] Flow matrix only has 222 transitions (discarded 2 similar events)
// Phase 1: matrix 222 rows 121 cols
[2025-05-31 08:53:52] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:53:52] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned sat
[2025-05-31 08:53:52] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:53:53] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 08:53:53] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 442 ms.
RANDOM walk for 127 steps (4 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
RANDOM walk for 3741 steps (139 resets) in 22 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1323 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (283 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 998110 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 1
Probabilistic random walk after 998110 steps, saw 238836 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2025-05-31 08:53:56] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2025-05-31 08:53:56] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 08:53:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 161 transition count 453
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 68 place count 158 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 441
Applied a total of 74 rules in 66 ms. Remains 158 /189 variables (removed 31) and now considering 441/514 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 158/189 places, 441/514 transitions.
RANDOM walk for 40000 steps (1312 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (276 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1021746 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1021746 steps, saw 251283 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2025-05-31 08:54:00] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 158 cols
[2025-05-31 08:54:00] [INFO ] Computed 7 invariants in 6 ms
[2025-05-31 08:54:00] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/382 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/560 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/562 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/562 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/382 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/560 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/562 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/562 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/562 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 787ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 441/441 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 158/158 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 441/441 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2025-05-31 08:54:00] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 08:54:00] [INFO ] Invariant cache hit.
[2025-05-31 08:54:01] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-31 08:54:01] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 08:54:01] [INFO ] Invariant cache hit.
[2025-05-31 08:54:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 08:54:01] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2025-05-31 08:54:01] [INFO ] Redundant transitions in 6 ms returned []
Running 435 sub problems to find dead transitions.
[2025-05-31 08:54:01] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 08:54:01] [INFO ] Invariant cache hit.
[2025-05-31 08:54:01] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 08:54:04] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 3 ms to minimize.
[2025-05-31 08:54:04] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 3 ms to minimize.
[2025-05-31 08:54:05] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2025-05-31 08:54:05] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2025-05-31 08:54:05] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2025-05-31 08:54:06] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2025-05-31 08:54:06] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2025-05-31 08:54:07] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2025-05-31 08:54:07] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2025-05-31 08:54:08] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 3 ms to minimize.
[2025-05-31 08:54:09] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/562 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/236 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 08:54:29] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-05-31 08:54:29] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/562 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 238 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/562 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 435/673 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 08:54:43] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-05-31 08:54:52] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 675 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 15/15 constraints]
After SMT, in 60689ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61640 ms. Remains : 158/158 places, 441/441 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 240
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 225
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 222
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 222
Applied a total of 46 rules in 35 ms. Remains 120 /158 variables (removed 38) and now considering 222/441 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:55:02] [INFO ] Flow matrix only has 220 transitions (discarded 2 similar events)
// Phase 1: matrix 220 rows 120 cols
[2025-05-31 08:55:02] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 08:55:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 08:55:02] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:55:02] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 08:55:02] [INFO ] After 189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:55:02] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:55:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:55:02] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:55:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2025-05-31 08:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2025-05-31 08:55:03] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:55:03] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 527 ms.
RANDOM walk for 27 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1283 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (291 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 870964 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 870964 steps, saw 206745 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2025-05-31 08:55:06] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2025-05-31 08:55:06] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 08:55:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 445
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 160 transition count 451
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 157 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 157 transition count 439
Applied a total of 76 rules in 112 ms. Remains 157 /189 variables (removed 32) and now considering 439/514 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 157/189 places, 439/514 transitions.
RANDOM walk for 40000 steps (1290 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (269 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 960970 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 1
Probabilistic random walk after 960970 steps, saw 236398 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2025-05-31 08:55:10] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
// Phase 1: matrix 402 rows 157 cols
[2025-05-31 08:55:10] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:55:10] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/379 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/557 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/379 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 157 /157 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/157 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 439/439 transitions.
Applied a total of 0 rules in 14 ms. Remains 157 /157 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2025-05-31 08:55:10] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2025-05-31 08:55:10] [INFO ] Invariant cache hit.
[2025-05-31 08:55:10] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-31 08:55:10] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2025-05-31 08:55:10] [INFO ] Invariant cache hit.
[2025-05-31 08:55:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 08:55:11] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2025-05-31 08:55:11] [INFO ] Redundant transitions in 5 ms returned []
Running 433 sub problems to find dead transitions.
[2025-05-31 08:55:11] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2025-05-31 08:55:11] [INFO ] Invariant cache hit.
[2025-05-31 08:55:11] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2025-05-31 08:55:15] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 3 ms to minimize.
[2025-05-31 08:55:15] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 2 ms to minimize.
[2025-05-31 08:55:15] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2025-05-31 08:55:15] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 08:55:16] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2025-05-31 08:55:17] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 08:55:17] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2025-05-31 08:55:18] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2025-05-31 08:55:18] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
[2025-05-31 08:55:18] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 2 ms to minimize.
[2025-05-31 08:55:19] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 402/559 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2025-05-31 08:55:28] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2025-05-31 08:55:34] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2025-05-31 08:55:38] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2025-05-31 08:55:38] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 402/559 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 433/672 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 672 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
After SMT, in 60558ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61589 ms. Remains : 157/157 places, 439/439 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 157 vertex of which 29 / 157 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 131 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 130 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 130 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 129 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 128 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 128 transition count 238
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 128 transition count 223
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 119 transition count 220
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 119 transition count 220
Applied a total of 46 rules in 25 ms. Remains 119 /157 variables (removed 38) and now considering 220/439 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:56:12] [INFO ] Flow matrix only has 218 transitions (discarded 2 similar events)
// Phase 1: matrix 218 rows 119 cols
[2025-05-31 08:56:12] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 08:56:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 08:56:12] [INFO ] After 90ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:56:12] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 08:56:12] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 202 ms.
RANDOM walk for 40000 steps (1268 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1006933 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1006933 steps, saw 240761 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2025-05-31 08:56:15] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2025-05-31 08:56:15] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:56:15] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 159 transition count 448
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 156 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 156 transition count 436
Applied a total of 78 rules in 54 ms. Remains 156 /189 variables (removed 33) and now considering 436/514 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 156/189 places, 436/514 transitions.
RANDOM walk for 40000 steps (1268 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (282 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1062514 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1062514 steps, saw 261881 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
[2025-05-31 08:56:19] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 156 cols
[2025-05-31 08:56:19] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:56:19] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/375 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/535 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/553 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/555 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/375 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/535 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/553 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-31 08:56:19] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 08:56:19] [INFO ] Invariant cache hit.
[2025-05-31 08:56:20] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-31 08:56:20] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 08:56:20] [INFO ] Invariant cache hit.
[2025-05-31 08:56:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 08:56:20] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2025-05-31 08:56:20] [INFO ] Redundant transitions in 4 ms returned []
Running 430 sub problems to find dead transitions.
[2025-05-31 08:56:20] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 08:56:20] [INFO ] Invariant cache hit.
[2025-05-31 08:56:20] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 08:56:23] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 3 ms to minimize.
[2025-05-31 08:56:23] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 2 ms to minimize.
[2025-05-31 08:56:24] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2025-05-31 08:56:24] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2025-05-31 08:56:24] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2025-05-31 08:56:24] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2025-05-31 08:56:25] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 2 ms to minimize.
[2025-05-31 08:56:25] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-05-31 08:56:26] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2025-05-31 08:56:26] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2025-05-31 08:56:26] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 2 ms to minimize.
[2025-05-31 08:56:27] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 08:56:29] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 399/555 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 59/235 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 08:56:38] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-05-31 08:56:39] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 237 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/555 variables, 156/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 59/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 430/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61216 ms. Remains : 156/156 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 236
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 221
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 218
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 218
Applied a total of 46 rules in 31 ms. Remains 118 /156 variables (removed 38) and now considering 218/436 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:57:21] [INFO ] Flow matrix only has 216 transitions (discarded 2 similar events)
// Phase 1: matrix 216 rows 118 cols
[2025-05-31 08:57:21] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 08:57:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:57:21] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:57:21] [INFO ] After 147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:57:21] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:57:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:57:21] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:57:21] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:57:21] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 444 ms.
RANDOM walk for 40000 steps (1280 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (257 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 906828 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 1
Probabilistic random walk after 906828 steps, saw 216977 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
[2025-05-31 08:57:24] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2025-05-31 08:57:24] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:57:24] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 822ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 440
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 158 transition count 446
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 155 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 155 transition count 434
Applied a total of 80 rules in 82 ms. Remains 155 /189 variables (removed 34) and now considering 434/514 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 155/189 places, 434/514 transitions.
RANDOM walk for 40000 steps (1280 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (267 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 956003 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 1
Probabilistic random walk after 956003 steps, saw 235313 distinct states, run finished after 3005 ms. (steps per millisecond=318 ) properties seen :0
[2025-05-31 08:57:28] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 155 cols
[2025-05-31 08:57:28] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:57:28] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/372 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/373 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/532 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/550 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/552 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/372 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/373 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/532 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/550 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/552 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-05-31 08:57:29] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 08:57:29] [INFO ] Invariant cache hit.
[2025-05-31 08:57:29] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-31 08:57:29] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 08:57:29] [INFO ] Invariant cache hit.
[2025-05-31 08:57:29] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 08:57:30] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2025-05-31 08:57:30] [INFO ] Redundant transitions in 5 ms returned []
Running 428 sub problems to find dead transitions.
[2025-05-31 08:57:30] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2025-05-31 08:57:30] [INFO ] Invariant cache hit.
[2025-05-31 08:57:30] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 08:57:33] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 3 ms to minimize.
[2025-05-31 08:57:34] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2025-05-31 08:57:34] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 2 ms to minimize.
[2025-05-31 08:57:34] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2025-05-31 08:57:34] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 08:57:35] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2025-05-31 08:57:36] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2025-05-31 08:57:37] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2025-05-31 08:57:37] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2025-05-31 08:57:37] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 2 ms to minimize.
[2025-05-31 08:57:38] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 08:57:39] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 08:57:45] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 397/552 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2025-05-31 08:57:57] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2025-05-31 08:58:00] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
SMT process timed out in 30685ms, After SMT, problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 30693ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31640 ms. Remains : 155/155 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 155 vertex of which 29 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 129 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 128 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 127 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 126 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 126 transition count 234
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 126 transition count 219
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 117 transition count 216
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 117 transition count 216
Applied a total of 46 rules in 38 ms. Remains 117 /155 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:58:01] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 117 cols
[2025-05-31 08:58:01] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:58:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:58:01] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:58:01] [INFO ] After 152ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 08:58:01] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
RANDOM walk for 40000 steps (1300 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 60 ms. (655 steps per ms) remains 1/1 properties

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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="FireWire-PT-13"
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 FireWire-PT-13, 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 r098-smll-174860112300212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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